./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.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 2ed7cb0d7dd44f90c8f2664b0f68587fb54e832248476997225ec2aff393c799 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:34:00,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:34:00,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:34:00,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:34:00,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:34:00,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:34:00,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:34:00,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:34:00,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:34:00,178 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:34:00,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:34:00,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:34:00,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:34:00,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:34:00,180 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:34:00,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:34:00,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:34:00,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:34:00,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:34:00,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:34:00,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:34:00,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:34:00,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:34:00,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:34:00,181 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:34:00,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:34:00,181 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:34:00,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:34:00,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:34:00,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:34:00,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:34:00,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:34:00,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:00,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:34:00,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:34:00,182 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:34:00,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:34:00,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:34:00,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:34:00,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:34:00,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:34:00,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:34:00,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:34:00,183 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 -> 2ed7cb0d7dd44f90c8f2664b0f68587fb54e832248476997225ec2aff393c799 [2025-03-08 13:34:00,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:34:00,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:34:00,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:34:00,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:34:00,416 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:34:00,417 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-24.i [2025-03-08 13:34:01,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baa16c55a/82dfce268d0c414a8f7dec209ede53d9/FLAGa9316b0d6 [2025-03-08 13:34:01,764 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:34:01,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.i [2025-03-08 13:34:01,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baa16c55a/82dfce268d0c414a8f7dec209ede53d9/FLAGa9316b0d6 [2025-03-08 13:34:02,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baa16c55a/82dfce268d0c414a8f7dec209ede53d9 [2025-03-08 13:34:02,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:34:02,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:34:02,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:02,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:34:02,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:34:02,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e875cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02, skipping insertion in model container [2025-03-08 13:34:02,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:34:02,214 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-24.i[917,930] [2025-03-08 13:34:02,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:02,272 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:34:02,280 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-24.i[917,930] [2025-03-08 13:34:02,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:02,319 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:34:02,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02 WrapperNode [2025-03-08 13:34:02,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:02,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:02,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:34:02,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:34:02,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,365 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-08 13:34:02,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:02,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:34:02,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:34:02,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:34:02,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,383 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:34:02,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:34:02,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:34:02,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:34:02,395 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:34:02,396 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (1/1) ... [2025-03-08 13:34:02,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:02,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:02,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:34:02,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:34:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:34:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:34:02,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:34:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:34:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:34:02,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:34:02,493 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:34:02,494 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:34:02,650 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 13:34:02,650 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:34:02,660 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:34:02,660 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:34:02,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:02 BoogieIcfgContainer [2025-03-08 13:34:02,660 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:34:02,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:34:02,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:34:02,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:34:02,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:34:02" (1/3) ... [2025-03-08 13:34:02,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64980dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:02, skipping insertion in model container [2025-03-08 13:34:02,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:02" (2/3) ... [2025-03-08 13:34:02,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64980dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:02, skipping insertion in model container [2025-03-08 13:34:02,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:02" (3/3) ... [2025-03-08 13:34:02,667 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-24.i [2025-03-08 13:34:02,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:34:02,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-24.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:34:02,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:34:02,732 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;@347970b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:34:02,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:34:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 13:34:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 13:34:02,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:02,744 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:34:02,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:02,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash 167597582, now seen corresponding path program 1 times [2025-03-08 13:34:02,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:34:02,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99946933] [2025-03-08 13:34:02,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:02,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:34:02,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:34:02,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:34:02,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:02,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 13:34:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:34:02,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99946933] [2025-03-08 13:34:02,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99946933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:34:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890237596] [2025-03-08 13:34:02,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:02,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:34:02,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:02,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:34:02,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:34:03,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:34:03,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:34:03,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:03,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:03,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:34:03,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 13:34:03,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:34:03,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890237596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:34:03,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:34:03,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:34:03,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002886908] [2025-03-08 13:34:03,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:34:03,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:34:03,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:34:03,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:34:03,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:03,148 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 13:34:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:03,163 INFO L93 Difference]: Finished difference Result 86 states and 142 transitions. [2025-03-08 13:34:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:34:03,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2025-03-08 13:34:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:03,169 INFO L225 Difference]: With dead ends: 86 [2025-03-08 13:34:03,169 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 13:34:03,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:03,173 INFO L435 NwaCegarLoop]: 61 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, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:03,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:34:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 13:34:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 13:34:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 13:34:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-03-08 13:34:03,203 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 96 [2025-03-08 13:34:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:03,203 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-03-08 13:34:03,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 13:34:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-03-08 13:34:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 13:34:03,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:03,206 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:34:03,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:34:03,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:34:03,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:03,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1047956173, now seen corresponding path program 1 times [2025-03-08 13:34:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:34:03,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363249795] [2025-03-08 13:34:03,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:03,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:34:03,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:34:03,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:34:03,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:03,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 13:34:04,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:34:04,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363249795] [2025-03-08 13:34:04,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363249795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:34:04,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626894545] [2025-03-08 13:34:04,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:04,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:34:04,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:04,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:34:04,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:34:04,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:34:04,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:34:04,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:04,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:04,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 13:34:04,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 18 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-08 13:34:04,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:34:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 13:34:04,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626894545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:34:04,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:34:04,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-03-08 13:34:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120390652] [2025-03-08 13:34:04,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:34:04,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 13:34:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:34:04,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 13:34:04,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-08 13:34:04,432 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 13:34:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:04,989 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2025-03-08 13:34:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 13:34:04,990 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 96 [2025-03-08 13:34:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:04,991 INFO L225 Difference]: With dead ends: 190 [2025-03-08 13:34:04,992 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 13:34:04,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=815, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 13:34:04,993 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 121 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:04,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 286 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:34:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 13:34:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 54. [2025-03-08 13:34:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 13:34:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2025-03-08 13:34:05,005 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 96 [2025-03-08 13:34:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:05,006 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-03-08 13:34:05,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 13:34:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2025-03-08 13:34:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 13:34:05,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:05,007 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:34:05,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 13:34:05,207 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,SelfDestructingSolverStorable1 [2025-03-08 13:34:05,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:05,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:05,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1504200788, now seen corresponding path program 1 times [2025-03-08 13:34:05,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:34:05,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287417362] [2025-03-08 13:34:05,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:05,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:34:05,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:34:05,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:34:05,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:05,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:34:05,256 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:34:05,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:34:05,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:34:05,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:05,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:34:05,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:34:05,340 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:34:05,340 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:34:05,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:34:05,346 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 13:34:05,393 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:34:05,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:34:05 BoogieIcfgContainer [2025-03-08 13:34:05,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:34:05,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:34:05,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:34:05,395 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:34:05,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:02" (3/4) ... [2025-03-08 13:34:05,397 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:34:05,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:34:05,398 INFO L158 Benchmark]: Toolchain (without parser) took 3305.16ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 122.3MB in the end (delta: 448.8kB). Peak memory consumption was 461.1kB. Max. memory is 16.1GB. [2025-03-08 13:34:05,398 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:34:05,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.50ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 110.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:34:05,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.01ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.0MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:34:05,399 INFO L158 Benchmark]: Boogie Preprocessor took 28.26ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:34:05,399 INFO L158 Benchmark]: IcfgBuilder took 265.65ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 89.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:34:05,399 INFO L158 Benchmark]: TraceAbstraction took 2732.97ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 122.3MB in the end (delta: -33.3MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2025-03-08 13:34:05,399 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 122.3MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:34:05,400 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.20ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.50ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 110.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.01ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.0MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.26ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 265.65ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 89.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2732.97ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 122.3MB in the end (delta: -33.3MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 122.3MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_4 = 16; [L25] signed char var_1_5 = 4; [L26] signed char var_1_6 = 0; [L27] unsigned short int var_1_7 = 0; [L28] unsigned short int var_1_10 = 55182; [L29] unsigned char var_1_12 = 0; [L30] unsigned char var_1_14 = 1; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 100; [L33] float var_1_17 = 2.25; [L34] float var_1_18 = 199.4; [L35] signed char var_1_19 = -128; VAL [isInitial=0, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=0, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L64] var_1_4 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L65] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L66] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L66] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L67] var_1_5 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L68] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L69] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L70] var_1_6 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L71] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L72] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L72] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L73] var_1_10 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L74] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L75] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L75] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L77] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L79] var_1_15 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L80] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L81] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L81] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L82] var_1_18 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L83] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L96] RET updateVariables() [L97] CALL step() [L39] COND FALSE !(! var_1_2) [L42] var_1_12 = ((! var_1_15) || (! (! 0))) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L44] var_1_16 = var_1_5 [L45] var_1_17 = var_1_18 [L46] var_1_19 = var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L47] COND FALSE !(var_1_12 || (64.75f < var_1_17)) [L54] var_1_1 = var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L56] COND TRUE (((((var_1_17 * 127.75)) > ((var_1_17 / 3.4))) ? ((var_1_17 * 127.75)) : ((var_1_17 / 3.4)))) >= var_1_17 [L57] var_1_7 = (((((var_1_10 - (22925 - var_1_5))) < (var_1_16)) ? ((var_1_10 - (22925 - var_1_5))) : (var_1_16))) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=4] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return ((((((var_1_12 || (64.75f < var_1_17)) ? (var_1_12 ? (var_1_1 == ((signed char) (var_1_4 - var_1_5))) : (var_1_1 == ((signed char) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < (var_1_6)) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6)))))) : (var_1_1 == ((signed char) var_1_4))) && (((((((var_1_17 * 127.75)) > ((var_1_17 / 3.4))) ? ((var_1_17 * 127.75)) : ((var_1_17 / 3.4)))) >= var_1_17) ? (var_1_7 == ((unsigned short int) (((((var_1_10 - (22925 - var_1_5))) < (var_1_16)) ? ((var_1_10 - (22925 - var_1_5))) : (var_1_16))))) : 1)) && ((! var_1_2) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) ((! var_1_15) || (! (! 0))))))) && (var_1_16 == ((unsigned char) var_1_5))) && (var_1_17 == ((float) var_1_18))) && (var_1_19 == ((signed char) var_1_4)) ; VAL [\result=0, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=4] [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=4] [L19] reach_error() VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 81 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 347 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 135 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 96 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 769 SizeOfPredicates, 1 NumberOfNonLiveVariables, 466 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2030/2100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:34:05,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.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 2ed7cb0d7dd44f90c8f2664b0f68587fb54e832248476997225ec2aff393c799 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:34:07,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:34:07,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:34:07,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:34:07,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:34:07,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:34:07,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:34:07,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:34:07,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:34:07,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:34:07,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:34:07,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:34:07,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:34:07,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:34:07,306 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:34:07,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:34:07,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:34:07,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:34:07,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:34:07,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:34:07,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:34:07,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:34:07,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:07,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:34:07,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:34:07,310 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:34:07,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:34:07,310 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:34:07,310 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:34:07,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:34:07,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:34:07,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:34:07,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:34:07,310 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 -> 2ed7cb0d7dd44f90c8f2664b0f68587fb54e832248476997225ec2aff393c799 [2025-03-08 13:34:07,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:34:07,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:34:07,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:34:07,599 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:34:07,599 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:34:07,601 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-24.i [2025-03-08 13:34:08,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8474d839a/d8706bc9db254ebd95bb5b47dbcf2746/FLAGd4f5c8df4 [2025-03-08 13:34:08,939 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:34:08,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.i [2025-03-08 13:34:08,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8474d839a/d8706bc9db254ebd95bb5b47dbcf2746/FLAGd4f5c8df4 [2025-03-08 13:34:09,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8474d839a/d8706bc9db254ebd95bb5b47dbcf2746 [2025-03-08 13:34:09,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:34:09,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:34:09,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:09,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:34:09,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:34:09,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46eb17a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09, skipping insertion in model container [2025-03-08 13:34:09,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:34:09,413 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-24.i[917,930] [2025-03-08 13:34:09,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:09,451 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:34:09,459 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-24.i[917,930] [2025-03-08 13:34:09,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:09,483 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:34:09,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09 WrapperNode [2025-03-08 13:34:09,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:09,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:09,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:34:09,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:34:09,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,508 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-08 13:34:09,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:09,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:34:09,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:34:09,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:34:09,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,528 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:34:09,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,537 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:34:09,545 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:34:09,545 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:34:09,545 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:34:09,546 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (1/1) ... [2025-03-08 13:34:09,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:09,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:09,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:34:09,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:34:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:34:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:34:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:34:09,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:34:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:34:09,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:34:09,654 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:34:09,656 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:34:22,523 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 13:34:22,523 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:34:22,531 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:34:22,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:34:22,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:22 BoogieIcfgContainer [2025-03-08 13:34:22,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:34:22,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:34:22,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:34:22,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:34:22,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:34:09" (1/3) ... [2025-03-08 13:34:22,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236ab26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:22, skipping insertion in model container [2025-03-08 13:34:22,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:09" (2/3) ... [2025-03-08 13:34:22,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236ab26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:22, skipping insertion in model container [2025-03-08 13:34:22,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:22" (3/3) ... [2025-03-08 13:34:22,541 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-24.i [2025-03-08 13:34:22,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:34:22,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-24.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:34:22,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:34:22,596 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;@7df54c42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:34:22,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:34:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 13:34:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 13:34:22,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:22,604 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:34:22,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:22,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 167597582, now seen corresponding path program 1 times [2025-03-08 13:34:22,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:22,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598189927] [2025-03-08 13:34:22,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:22,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:34:22,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:22,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:34:22,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:34:22,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:34:23,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:34:23,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:23,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:23,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:34:23,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-08 13:34:23,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:34:23,406 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:34:23,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598189927] [2025-03-08 13:34:23,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598189927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:34:23,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:34:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:34:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049621453] [2025-03-08 13:34:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:34:23,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:34:23,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:34:23,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:34:23,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:23,424 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 13:34:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:23,438 INFO L93 Difference]: Finished difference Result 86 states and 142 transitions. [2025-03-08 13:34:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:34:23,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2025-03-08 13:34:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:23,442 INFO L225 Difference]: With dead ends: 86 [2025-03-08 13:34:23,442 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 13:34:23,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:23,446 INFO L435 NwaCegarLoop]: 61 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, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:23,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:34:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 13:34:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 13:34:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 13:34:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-03-08 13:34:23,486 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 96 [2025-03-08 13:34:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:23,486 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-03-08 13:34:23,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 13:34:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-03-08 13:34:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 13:34:23,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:23,491 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:34:23,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 13:34:23,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:34:23,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:23,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:23,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1047956173, now seen corresponding path program 1 times [2025-03-08 13:34:23,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:23,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055668927] [2025-03-08 13:34:23,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:23,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:34:23,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:23,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:34:23,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:34:23,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:34:24,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:34:24,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:24,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:24,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 13:34:24,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 18 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-08 13:34:26,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:34:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 13:34:28,237 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:34:28,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055668927] [2025-03-08 13:34:28,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055668927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:34:28,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:34:28,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2025-03-08 13:34:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445662845] [2025-03-08 13:34:28,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:34:28,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 13:34:28,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:34:28,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 13:34:28,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:34:28,239 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 13:34:34,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:38,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:42,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:46,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:50,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:54,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:59,537 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2025-03-08 13:34:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 13:34:59,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 96 [2025-03-08 13:34:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:59,540 INFO L225 Difference]: With dead ends: 190 [2025-03-08 13:34:59,540 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 13:34:59,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 13:34:59,541 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 94 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 61 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:59,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 256 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 277 Invalid, 5 Unknown, 0 Unchecked, 28.2s Time] [2025-03-08 13:34:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 13:34:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 54. [2025-03-08 13:34:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 13:34:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2025-03-08 13:34:59,554 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 96 [2025-03-08 13:34:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:59,554 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-03-08 13:34:59,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 13:34:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2025-03-08 13:34:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 13:34:59,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:59,556 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:34:59,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 13:34:59,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:34:59,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:59,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1504200788, now seen corresponding path program 1 times [2025-03-08 13:34:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151784998] [2025-03-08 13:34:59,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:59,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:34:59,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:59,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:34:59,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:34:59,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 13:35:00,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 13:35:00,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:35:00,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:35:00,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 13:35:00,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:35:12,908 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:35:18,159 WARN L286 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:35:26,556 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:35:32,051 WARN L286 SmtUtils]: Spent 5.49s on a formula simplification. DAG size of input: 11 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:35:40,424 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)