./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-9.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 8c739365ea97b8d8f582c1641d81069a58ff4a5e699a71dc4c2b9835245908d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:30:32,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:30:33,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:30:33,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:30:33,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:30:33,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:30:33,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:30:33,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:30:33,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:30:33,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:30:33,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:30:33,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:30:33,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:30:33,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:30:33,047 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:30:33,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:30:33,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:30:33,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:30:33,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:30:33,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:30:33,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:30:33,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:30:33,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:30:33,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:30:33,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:30:33,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:30:33,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:30:33,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:30:33,049 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 -> 8c739365ea97b8d8f582c1641d81069a58ff4a5e699a71dc4c2b9835245908d7 [2025-03-03 22:30:33,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:30:33,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:30:33,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:30:33,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:30:33,275 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:30:33,275 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-9.i [2025-03-03 22:30:34,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d764798/0cae0a556b6f41d8b195f1b9471d37da/FLAG9b4df7816 [2025-03-03 22:30:34,658 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:30:34,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i [2025-03-03 22:30:34,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d764798/0cae0a556b6f41d8b195f1b9471d37da/FLAG9b4df7816 [2025-03-03 22:30:35,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d764798/0cae0a556b6f41d8b195f1b9471d37da [2025-03-03 22:30:35,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:30:35,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:30:35,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:30:35,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:30:35,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:30:35,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35, skipping insertion in model container [2025-03-03 22:30:35,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:30:35,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i[916,929] [2025-03-03 22:30:35,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:30:35,154 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:30:35,162 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-9.i[916,929] [2025-03-03 22:30:35,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:30:35,197 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:30:35,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35 WrapperNode [2025-03-03 22:30:35,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:30:35,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:30:35,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:30:35,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:30:35,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,235 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-03 22:30:35,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:30:35,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:30:35,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:30:35,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:30:35,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,250 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-03 22:30:35,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:30:35,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:30:35,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:30:35,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:30:35,266 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (1/1) ... [2025-03-03 22:30:35,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:30:35,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:30:35,291 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-03 22:30:35,293 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-03 22:30:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:30:35,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:30:35,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:30:35,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:30:35,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:30:35,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:30:35,358 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:30:35,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:30:35,500 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: havoc property_#t~bitwise8#1;havoc property_#t~short9#1; [2025-03-03 22:30:35,515 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 22:30:35,516 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:30:35,524 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:30:35,525 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:30:35,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:35 BoogieIcfgContainer [2025-03-03 22:30:35,525 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:30:35,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:30:35,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:30:35,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:30:35,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:30:35" (1/3) ... [2025-03-03 22:30:35,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4e055d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:35, skipping insertion in model container [2025-03-03 22:30:35,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:35" (2/3) ... [2025-03-03 22:30:35,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4e055d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:35, skipping insertion in model container [2025-03-03 22:30:35,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:35" (3/3) ... [2025-03-03 22:30:35,532 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-9.i [2025-03-03 22:30:35,541 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:30:35,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-9.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:30:35,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:30:35,588 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;@641a7d16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:30:35,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:30:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 22:30:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 22:30:35,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:35,597 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 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-03 22:30:35,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:35,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2126177781, now seen corresponding path program 1 times [2025-03-03 22:30:35,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:30:35,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195382122] [2025-03-03 22:30:35,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:35,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:30:35,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 22:30:35,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 22:30:35,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:35,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 22:30:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:30:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195382122] [2025-03-03 22:30:35,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195382122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:30:35,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821299220] [2025-03-03 22:30:35,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:35,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:30:35,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:30:35,765 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-03 22:30:35,767 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-03 22:30:35,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 22:30:35,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 22:30:35,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:35,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:35,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:30:35,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:30:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 22:30:35,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:30:35,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821299220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:30:35,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:30:35,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:30:35,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796156282] [2025-03-03 22:30:35,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:30:35,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:30:35,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:30:35,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:30:35,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:30:35,894 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 22:30:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:30:35,910 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2025-03-03 22:30:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:30:35,913 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2025-03-03 22:30:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:30:35,917 INFO L225 Difference]: With dead ends: 74 [2025-03-03 22:30:35,917 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 22:30:35,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 46 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-03 22:30:35,921 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:30:35,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:30:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 22:30:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-03 22:30:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 22:30:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2025-03-03 22:30:35,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 45 [2025-03-03 22:30:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:30:35,945 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2025-03-03 22:30:35,945 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 22:30:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2025-03-03 22:30:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 22:30:35,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:35,947 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 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-03 22:30:35,953 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-03 22:30:36,148 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-03 22:30:36,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:36,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash 30940138, now seen corresponding path program 1 times [2025-03-03 22:30:36,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:30:36,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808821946] [2025-03-03 22:30:36,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:36,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:30:36,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 22:30:36,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 22:30:36,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:36,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 22:30:38,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:30:38,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808821946] [2025-03-03 22:30:38,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808821946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:30:38,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:30:38,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:30:38,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679861745] [2025-03-03 22:30:38,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:30:38,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:30:38,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:30:38,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:30:38,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:30:38,169 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 22:30:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:30:38,344 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2025-03-03 22:30:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:30:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2025-03-03 22:30:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:30:38,345 INFO L225 Difference]: With dead ends: 135 [2025-03-03 22:30:38,345 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 22:30:38,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:30:38,346 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 112 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:30:38,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 179 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:30:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 22:30:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 60. [2025-03-03 22:30:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 22:30:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2025-03-03 22:30:38,355 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 45 [2025-03-03 22:30:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:30:38,356 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2025-03-03 22:30:38,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 22:30:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2025-03-03 22:30:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 22:30:38,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:38,357 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 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-03 22:30:38,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:30:38,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:38,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1967840665, now seen corresponding path program 1 times [2025-03-03 22:30:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:30:38,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407465237] [2025-03-03 22:30:38,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:38,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:30:38,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 22:30:38,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 22:30:38,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:38,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 22:30:38,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:30:38,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407465237] [2025-03-03 22:30:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407465237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:30:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:30:38,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:30:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024722825] [2025-03-03 22:30:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:30:38,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:30:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:30:38,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:30:38,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:30:38,635 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 22:30:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:30:38,687 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2025-03-03 22:30:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:30:38,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2025-03-03 22:30:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:30:38,688 INFO L225 Difference]: With dead ends: 100 [2025-03-03 22:30:38,688 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 22:30:38,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:30:38,689 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:30:38,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 190 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:30:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 22:30:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 22:30:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 22:30:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2025-03-03 22:30:38,701 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 46 [2025-03-03 22:30:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:30:38,701 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2025-03-03 22:30:38,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 22:30:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2025-03-03 22:30:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 22:30:38,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:38,703 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:30:38,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:30:38,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:38,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1941329885, now seen corresponding path program 1 times [2025-03-03 22:30:38,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:30:38,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308071415] [2025-03-03 22:30:38,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:38,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:30:38,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 22:30:38,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 22:30:38,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:38,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:30:38,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620080022] [2025-03-03 22:30:38,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:38,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:30:38,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:30:38,738 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-03 22:30:38,740 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-03 22:30:38,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 22:30:38,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 22:30:38,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:38,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:30:38,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:30:38,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 22:30:38,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 22:30:38,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:38,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:30:38,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:30:38,878 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:30:38,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:30:38,885 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-03 22:30:39,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 22:30:39,084 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 22:30:39,110 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:30:39,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:30:39 BoogieIcfgContainer [2025-03-03 22:30:39,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:30:39,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:30:39,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:30:39,112 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:30:39,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:35" (3/4) ... [2025-03-03 22:30:39,114 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:30:39,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:30:39,115 INFO L158 Benchmark]: Toolchain (without parser) took 4107.68ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 113.2MB in the beginning and 110.3MB in the end (delta: 2.9MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. [2025-03-03 22:30:39,115 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:30:39,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.26ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 100.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:30:39,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:30:39,116 INFO L158 Benchmark]: Boogie Preprocessor took 29.46ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:30:39,117 INFO L158 Benchmark]: IcfgBuilder took 259.42ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 79.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:30:39,117 INFO L158 Benchmark]: TraceAbstraction took 3585.25ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 79.0MB in the beginning and 110.4MB in the end (delta: -31.4MB). Peak memory consumption was 110.5MB. Max. memory is 16.1GB. [2025-03-03 22:30:39,117 INFO L158 Benchmark]: Witness Printer took 2.29ms. Allocated memory is still 285.2MB. Free memory was 110.4MB in the beginning and 110.3MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:30:39,118 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.16ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.26ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 100.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.46ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 259.42ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 79.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3585.25ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 79.0MB in the beginning and 110.4MB in the end (delta: -31.4MB). Peak memory consumption was 110.5MB. Max. memory is 16.1GB. * Witness Printer took 2.29ms. Allocated memory is still 285.2MB. Free memory was 110.4MB in the beginning and 110.3MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 45, overapproximation of shiftLeft at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_3 = 4; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 100; [L26] unsigned char var_1_9 = 32; [L27] double var_1_10 = 9.2; [L28] double var_1_11 = 0.975; [L29] signed short int var_1_12 = 1; [L30] signed long int var_1_14 = -16; [L31] unsigned char last_1_var_1_1 = 10; [L32] double last_1_var_1_10 = 9.2; [L33] signed short int last_1_var_1_12 = 1; [L34] signed long int last_1_var_1_14 = -16; VAL [isInitial=0, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L75] last_1_var_1_1 = var_1_1 [L76] last_1_var_1_10 = var_1_10 [L77] last_1_var_1_12 = var_1_12 [L78] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L88] RET updateLastVariables() [L89] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L67] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L67] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L68] var_1_7 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_8=100, var_1_9=32] [L69] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_8=100, var_1_9=32] [L70] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L70] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L89] RET updateVariables() [L90] CALL step() [L38] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=1, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L39] COND TRUE ((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0 [L40] var_1_12 = ((((((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? (((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=10, var_1_14=-16, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L44] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L45] EXPR 10 << var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=100, var_1_9=32] [L45] COND TRUE (10 << var_1_12) < (var_1_3 * var_1_14) [L46] var_1_8 = (var_1_12 + var_1_14) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=20, var_1_9=32] [L48] var_1_9 = 64 [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=2, var_1_7=0, var_1_8=20, var_1_9=64] [L50] COND TRUE var_1_12 <= 16 [L51] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=2, var_1_3=2, var_1_7=0, var_1_8=20, var_1_9=64] [L90] RET step() [L91] CALL, EXPR property() [L81] EXPR ((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=2, var_1_3=2, var_1_7=0, var_1_8=20, var_1_9=64] [L81] EXPR 10 << var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=2, var_1_3=2, var_1_7=0, var_1_8=20, var_1_9=64] [L81] EXPR ((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=2, var_1_3=2, var_1_7=0, var_1_8=20, var_1_9=64] [L81-L82] return ((((((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1)) && (var_1_9 == ((unsigned char) 64))) && (var_1_10 == ((double) var_1_11))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? (var_1_12 == ((signed short int) ((((((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? (((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : (var_1_12 == ((signed short int) last_1_var_1_12)))) && (var_1_14 == ((signed long int) var_1_12)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=2, var_1_3=2, var_1_7=0, var_1_8=20, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=2, var_1_3=2, var_1_7=0, var_1_8=20, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 126 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 41 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 152/160 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-03 22:30:39,132 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-9.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 8c739365ea97b8d8f582c1641d81069a58ff4a5e699a71dc4c2b9835245908d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:30:40,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:30:40,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:30:40,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:30:40,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:30:40,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:30:40,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:30:40,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:30:40,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:30:40,964 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:30:40,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:30:40,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:30:40,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:30:40,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:30:40,965 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:30:40,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:30:40,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:30:40,965 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:30:40,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:30:40,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:30:40,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:30:40,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:30:40,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:30:40,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:30:40,966 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:30:40,966 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:30:40,966 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:30:40,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:30:40,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:30:40,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:30:40,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:30:40,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:30:40,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:30:40,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:30:40,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:30:40,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:30:40,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:30:40,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:30:40,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:30:40,968 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:30:40,968 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:30:40,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:30:40,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:30:40,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:30:40,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:30:40,968 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 -> 8c739365ea97b8d8f582c1641d81069a58ff4a5e699a71dc4c2b9835245908d7 [2025-03-03 22:30:41,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:30:41,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:30:41,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:30:41,189 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:30:41,189 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:30:41,190 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-9.i [2025-03-03 22:30:42,322 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b88c0d8d4/2cf14e4bd3e64246ad00fccf91a05ca8/FLAGf5dd32b10 [2025-03-03 22:30:42,473 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:30:42,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i [2025-03-03 22:30:42,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b88c0d8d4/2cf14e4bd3e64246ad00fccf91a05ca8/FLAGf5dd32b10 [2025-03-03 22:30:42,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b88c0d8d4/2cf14e4bd3e64246ad00fccf91a05ca8 [2025-03-03 22:30:42,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:30:42,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:30:42,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:30:42,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:30:42,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:30:42,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:42" (1/1) ... [2025-03-03 22:30:42,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62bd342b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:42, skipping insertion in model container [2025-03-03 22:30:42,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:42" (1/1) ... [2025-03-03 22:30:42,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:30:42,983 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-9.i[916,929] [2025-03-03 22:30:43,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:30:43,017 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:30:43,024 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-9.i[916,929] [2025-03-03 22:30:43,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:30:43,045 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:30:43,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43 WrapperNode [2025-03-03 22:30:43,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:30:43,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:30:43,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:30:43,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:30:43,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,069 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2025-03-03 22:30:43,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:30:43,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:30:43,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:30:43,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:30:43,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,086 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-03 22:30:43,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:30:43,096 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:30:43,096 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:30:43,096 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:30:43,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (1/1) ... [2025-03-03 22:30:43,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:30:43,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:30:43,121 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-03 22:30:43,124 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-03 22:30:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:30:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:30:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:30:43,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:30:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:30:43,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:30:43,195 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:30:43,196 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:30:43,398 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:30:43,399 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:30:43,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:30:43,408 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:30:43,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:43 BoogieIcfgContainer [2025-03-03 22:30:43,409 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:30:43,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:30:43,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:30:43,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:30:43,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:30:42" (1/3) ... [2025-03-03 22:30:43,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cca1b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:43, skipping insertion in model container [2025-03-03 22:30:43,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:43" (2/3) ... [2025-03-03 22:30:43,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cca1b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:43, skipping insertion in model container [2025-03-03 22:30:43,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:43" (3/3) ... [2025-03-03 22:30:43,420 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-9.i [2025-03-03 22:30:43,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:30:43,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-9.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:30:43,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:30:43,476 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;@3c559bc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:30:43,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:30:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 22:30:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 22:30:43,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:43,483 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 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-03 22:30:43,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:43,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1571446655, now seen corresponding path program 1 times [2025-03-03 22:30:43,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:30:43,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735554283] [2025-03-03 22:30:43,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:43,495 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-03 22:30:43,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:30:43,510 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-03 22:30:43,511 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-03 22:30:43,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 22:30:43,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 22:30:43,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:43,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:43,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:30:43,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:30:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 22:30:43,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:30:43,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:30:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735554283] [2025-03-03 22:30:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735554283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:30:43,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:30:43,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:30:43,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145529754] [2025-03-03 22:30:43,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:30:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:30:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:30:43,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:30:43,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:30:43,664 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 22:30:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:30:43,676 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2025-03-03 22:30:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:30:43,677 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-03-03 22:30:43,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:30:43,681 INFO L225 Difference]: With dead ends: 59 [2025-03-03 22:30:43,681 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 22:30:43,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-03 22:30:43,684 INFO L435 NwaCegarLoop]: 36 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, 36 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-03 22:30:43,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:30:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 22:30:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-03 22:30:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 22:30:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-03 22:30:43,705 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 42 [2025-03-03 22:30:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:30:43,705 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-03 22:30:43,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 22:30:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-03 22:30:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 22:30:43,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:43,707 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 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-03 22:30:43,711 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-03 22:30:43,907 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-03 22:30:43,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:43,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2103362048, now seen corresponding path program 1 times [2025-03-03 22:30:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:30:43,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807204382] [2025-03-03 22:30:43,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:43,909 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-03 22:30:43,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:30:43,913 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-03 22:30:43,914 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-03 22:30:43,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 22:30:43,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 22:30:43,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:43,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:43,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:30:43,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:30:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 22:30:44,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:30:44,306 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:30:44,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807204382] [2025-03-03 22:30:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807204382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:30:44,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:30:44,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:30:44,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923113204] [2025-03-03 22:30:44,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:30:44,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:30:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:30:44,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:30:44,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:30:44,308 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 22:30:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:30:44,453 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2025-03-03 22:30:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:30:44,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2025-03-03 22:30:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:30:44,456 INFO L225 Difference]: With dead ends: 81 [2025-03-03 22:30:44,456 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 22:30:44,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:30:44,457 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:30:44,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 97 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:30:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 22:30:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2025-03-03 22:30:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 22:30:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2025-03-03 22:30:44,484 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 42 [2025-03-03 22:30:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:30:44,484 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-03-03 22:30:44,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 22:30:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2025-03-03 22:30:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 22:30:44,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:30:44,485 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 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-03 22:30:44,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:30:44,690 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-03 22:30:44,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:30:44,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:30:44,691 INFO L85 PathProgramCache]: Analyzing trace with hash 295907585, now seen corresponding path program 1 times [2025-03-03 22:30:44,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:30:44,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100813120] [2025-03-03 22:30:44,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:30:44,691 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-03 22:30:44,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:30:44,693 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-03 22:30:44,695 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-03 22:30:44,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 22:30:44,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 22:30:44,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:30:44,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:30:44,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 22:30:44,755 INFO L279 TraceCheckSpWp]: Computing forward predicates...