./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-8.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:40:41,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:40:41,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:40:41,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:40:41,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:40:41,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:40:41,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:40:41,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:40:41,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:40:41,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:40:41,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:40:41,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:40:41,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:40:41,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:40:41,130 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:40:41,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:40:41,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:40:41,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:40:41,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:40:41,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:40:41,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:40:41,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:40:41,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:40:41,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:40:41,133 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:40:41,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:40:41,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:40:41,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:40:41,134 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:40:41,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:40:41,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:40:41,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:40:41,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:41,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:40:41,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:40:41,135 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:40:41,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:40:41,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:40:41,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:40:41,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:40:41,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:40:41,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:40:41,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:40:41,135 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 [2025-03-08 13:40:41,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:40:41,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:40:41,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:40:41,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:40:41,379 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:40:41,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i [2025-03-08 13:40:42,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeaeb7223/a260c5defdb0444bbaf256bc03c80b62/FLAG9ffee71ca [2025-03-08 13:40:42,679 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:40:42,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i [2025-03-08 13:40:42,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeaeb7223/a260c5defdb0444bbaf256bc03c80b62/FLAG9ffee71ca [2025-03-08 13:40:43,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeaeb7223/a260c5defdb0444bbaf256bc03c80b62 [2025-03-08 13:40:43,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:40:43,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:40:43,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:43,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:40:43,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:40:43,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35249644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43, skipping insertion in model container [2025-03-08 13:40:43,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:40:43,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i[916,929] [2025-03-08 13:40:43,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:43,211 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:40:43,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i[916,929] [2025-03-08 13:40:43,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:43,255 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:40:43,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43 WrapperNode [2025-03-08 13:40:43,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:43,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:43,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:40:43,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:40:43,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,287 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-08 13:40:43,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:43,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:40:43,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:40:43,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:40:43,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,305 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:40:43,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:40:43,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:40:43,314 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:40:43,314 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:40:43,315 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (1/1) ... [2025-03-08 13:40:43,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:43,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:40:43,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:40:43,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:40:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:40:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:40:43,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:40:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:40:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:40:43,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:40:43,411 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:40:43,413 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:40:43,565 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 13:40:43,565 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:40:43,571 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:40:43,571 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:40:43,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:43 BoogieIcfgContainer [2025-03-08 13:40:43,572 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:40:43,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:40:43,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:40:43,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:40:43,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:40:43" (1/3) ... [2025-03-08 13:40:43,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52df12f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:43, skipping insertion in model container [2025-03-08 13:40:43,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:43" (2/3) ... [2025-03-08 13:40:43,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52df12f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:43, skipping insertion in model container [2025-03-08 13:40:43,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:43" (3/3) ... [2025-03-08 13:40:43,579 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-8.i [2025-03-08 13:40:43,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:40:43,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-8.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:40:43,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:40:43,632 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;@30cc3b56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:40:43,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:40:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 13:40:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 13:40:43,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:43,643 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:43,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:43,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1719937042, now seen corresponding path program 1 times [2025-03-08 13:40:43,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:40:43,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100754145] [2025-03-08 13:40:43,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:40:43,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:40:43,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:40:43,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:43,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 13:40:43,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:40:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100754145] [2025-03-08 13:40:43,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100754145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:40:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728828268] [2025-03-08 13:40:43,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:43,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:40:43,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:40:43,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:40:43,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:40:43,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:40:43,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:40:43,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:43,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:43,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:40:43,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:40:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 13:40:43,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:40:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728828268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:43,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:40:43,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:40:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400160607] [2025-03-08 13:40:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:43,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:40:43,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:40:43,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:40:43,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:43,962 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 13:40:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:43,975 INFO L93 Difference]: Finished difference Result 86 states and 139 transitions. [2025-03-08 13:40:43,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:40:43,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-03-08 13:40:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:43,980 INFO L225 Difference]: With dead ends: 86 [2025-03-08 13:40:43,980 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 13:40:43,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:43,984 INFO L435 NwaCegarLoop]: 60 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, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:43,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:40:43,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 13:40:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 13:40:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 13:40:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2025-03-08 13:40:44,007 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 92 [2025-03-08 13:40:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:44,007 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2025-03-08 13:40:44,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 13:40:44,008 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2025-03-08 13:40:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 13:40:44,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:44,010 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:44,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:40:44,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:40:44,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:44,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash 507739090, now seen corresponding path program 1 times [2025-03-08 13:40:44,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:40:44,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971430873] [2025-03-08 13:40:44,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:40:44,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:40:44,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:40:44,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:44,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:44,397 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 13:40:44,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:40:44,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971430873] [2025-03-08 13:40:44,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971430873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:44,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:44,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:40:44,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295379350] [2025-03-08 13:40:44,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:44,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:40:44,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:40:44,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:40:44,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:40:44,400 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 13:40:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:44,484 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2025-03-08 13:40:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:40:44,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-03-08 13:40:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:44,485 INFO L225 Difference]: With dead ends: 83 [2025-03-08 13:40:44,485 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 13:40:44,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:40:44,486 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:44,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 76 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:40:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 13:40:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 13:40:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 13:40:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2025-03-08 13:40:44,493 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 92 [2025-03-08 13:40:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:44,495 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2025-03-08 13:40:44,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 13:40:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2025-03-08 13:40:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 13:40:44,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:44,497 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:44,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:40:44,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:44,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash 536368241, now seen corresponding path program 1 times [2025-03-08 13:40:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:40:44,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863996777] [2025-03-08 13:40:44,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:40:44,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:40:44,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:40:44,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:44,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:40:44,594 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:40:44,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:40:44,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:40:44,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:44,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:40:44,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:40:44,677 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:40:44,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:40:44,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:40:44,681 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 13:40:44,715 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:40:44,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:40:44 BoogieIcfgContainer [2025-03-08 13:40:44,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:40:44,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:40:44,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:40:44,717 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:40:44,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:43" (3/4) ... [2025-03-08 13:40:44,719 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:40:44,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:40:44,720 INFO L158 Benchmark]: Toolchain (without parser) took 1675.61ms. Allocated memory is still 201.3MB. Free memory was 159.2MB in the beginning and 142.3MB in the end (delta: 16.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-03-08 13:40:44,720 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:44,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.07ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 146.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:40:44,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.05ms. Allocated memory is still 201.3MB. Free memory was 146.5MB in the beginning and 144.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:40:44,720 INFO L158 Benchmark]: Boogie Preprocessor took 23.50ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 142.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:44,720 INFO L158 Benchmark]: IcfgBuilder took 259.75ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 126.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:40:44,721 INFO L158 Benchmark]: TraceAbstraction took 1142.92ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 142.3MB in the end (delta: -16.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:44,721 INFO L158 Benchmark]: Witness Printer took 2.29ms. Allocated memory is still 201.3MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:44,723 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.51ms. Allocated memory is still 201.3MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.07ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 146.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.05ms. Allocated memory is still 201.3MB. Free memory was 146.5MB in the beginning and 144.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.50ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 142.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 259.75ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 126.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1142.92ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 142.3MB in the end (delta: -16.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.29ms. Allocated memory is still 201.3MB. Free memory is still 142.3MB. 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 80, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed long int var_1_8 = 64; [L28] float var_1_12 = 2.4; [L29] float var_1_13 = 127.75; [L30] float var_1_14 = 0.0; [L31] float var_1_15 = 31.4; [L32] float var_1_16 = 256.75; [L33] float var_1_17 = 256.6; [L34] signed long int var_1_18 = 0; [L35] unsigned char var_1_19 = 32; [L36] unsigned char var_1_20 = 100; VAL [isInitial=0, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L72] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L72] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L73] var_1_6 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L75] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L75] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L77] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L79] var_1_13 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L80] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L81] var_1_14 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L82] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L83] var_1_15 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L84] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L85] var_1_16 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L86] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L87] var_1_20 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L88] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L102] RET updateVariables() [L103] CALL step() [L40] var_1_17 = var_1_14 [L41] var_1_19 = var_1_20 [L42] var_1_18 = var_1_19 [L43] unsigned char stepLocal_1 = var_1_19; [L44] signed long int stepLocal_0 = (var_1_18 * var_1_18) * (var_1_19 - var_1_19); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=256, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L45] COND FALSE !(stepLocal_0 >= 1u) [L52] var_1_8 = var_1_19 VAL [isInitial=1, stepLocal_1=256, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L54] signed long int stepLocal_2 = var_1_8; VAL [isInitial=1, stepLocal_1=256, stepLocal_2=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L55] COND FALSE !(var_1_19 > stepLocal_2) [L58] var_1_12 = (var_1_16 - (var_1_14 + var_1_15)) VAL [isInitial=1, stepLocal_1=256, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L60] COND TRUE var_1_18 >= (8u * var_1_8) [L61] var_1_1 = (! (var_1_4 || (var_1_5 || var_1_6))) VAL [isInitial=1, stepLocal_1=256, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=1, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L103] RET step() [L104] CALL, EXPR property() [L94-L95] return ((((((var_1_18 >= (8u * var_1_8)) ? (var_1_1 == ((unsigned char) (! (var_1_4 || (var_1_5 || var_1_6))))) : (var_1_1 == ((unsigned char) var_1_7))) && ((((var_1_18 * var_1_18) * (var_1_19 - var_1_19)) >= 1u) ? ((var_1_18 <= var_1_19) ? (var_1_8 == ((signed long int) var_1_19)) : (var_1_8 == ((signed long int) var_1_19))) : (var_1_8 == ((signed long int) var_1_19)))) && ((var_1_19 > var_1_8) ? (var_1_12 == ((float) (var_1_13 + ((var_1_14 - var_1_15) - var_1_16)))) : (var_1_12 == ((float) (var_1_16 - (var_1_14 + var_1_15)))))) && (var_1_17 == ((float) var_1_14))) && (var_1_18 == ((signed long int) var_1_19))) && (var_1_19 == ((unsigned char) var_1_20)) ; VAL [\result=0, isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=1, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=1, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=1, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 79 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 114 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1066/1092 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:40:44,736 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-8.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:40:46,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:40:46,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:40:46,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:40:46,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:40:46,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:40:46,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:40:46,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:40:46,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:40:46,583 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:40:46,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:40:46,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:40:46,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:40:46,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:40:46,583 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:40:46,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:40:46,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:40:46,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:40:46,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:40:46,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:40:46,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:40:46,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:46,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:40:46,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:40:46,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:40:46,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:40:46,586 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:40:46,586 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:40:46,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:40:46,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:40:46,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:40:46,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:40:46,586 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 [2025-03-08 13:40:46,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:40:46,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:40:46,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:40:46,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:40:46,825 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:40:46,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i [2025-03-08 13:40:48,017 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f12e375/91d8be4e85cc4d6f8ccd1672e43b6cfc/FLAGe4fed2a0c [2025-03-08 13:40:48,165 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:40:48,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i [2025-03-08 13:40:48,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f12e375/91d8be4e85cc4d6f8ccd1672e43b6cfc/FLAGe4fed2a0c [2025-03-08 13:40:48,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f12e375/91d8be4e85cc4d6f8ccd1672e43b6cfc [2025-03-08 13:40:48,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:40:48,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:40:48,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:48,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:40:48,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:40:48,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a58a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48, skipping insertion in model container [2025-03-08 13:40:48,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:40:48,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i[916,929] [2025-03-08 13:40:48,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:48,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:40:48,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i[916,929] [2025-03-08 13:40:48,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:48,396 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:40:48,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48 WrapperNode [2025-03-08 13:40:48,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:48,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:48,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:40:48,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:40:48,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,422 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-08 13:40:48,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:48,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:40:48,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:40:48,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:40:48,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,437 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:40:48,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:40:48,446 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:40:48,446 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:40:48,447 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:40:48,447 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (1/1) ... [2025-03-08 13:40:48,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:48,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:40:48,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:40:48,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:40:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:40:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:40:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:40:48,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:40:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:40:48,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:40:48,547 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:40:48,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:40:50,765 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 13:40:50,765 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:40:50,773 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:40:50,773 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:40:50,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:50 BoogieIcfgContainer [2025-03-08 13:40:50,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:40:50,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:40:50,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:40:50,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:40:50,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:40:48" (1/3) ... [2025-03-08 13:40:50,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54edb585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:50, skipping insertion in model container [2025-03-08 13:40:50,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:48" (2/3) ... [2025-03-08 13:40:50,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54edb585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:50, skipping insertion in model container [2025-03-08 13:40:50,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:50" (3/3) ... [2025-03-08 13:40:50,779 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-8.i [2025-03-08 13:40:50,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:40:50,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-8.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:40:50,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:40:50,835 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;@69ad8f01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:40:50,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:40:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 13:40:50,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 13:40:50,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:50,843 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:50,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:50,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1719937042, now seen corresponding path program 1 times [2025-03-08 13:40:50,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:40:50,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896088864] [2025-03-08 13:40:50,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:50,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:50,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:40:50,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:40:50,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:40:50,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:40:51,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:40:51,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:51,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:51,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:40:51,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:40:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-08 13:40:51,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:40:51,139 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:40:51,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896088864] [2025-03-08 13:40:51,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896088864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:51,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:51,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:40:51,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448354334] [2025-03-08 13:40:51,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:51,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:40:51,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:40:51,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:40:51,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:51,160 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 13:40:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:51,174 INFO L93 Difference]: Finished difference Result 86 states and 139 transitions. [2025-03-08 13:40:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:40:51,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-03-08 13:40:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:51,178 INFO L225 Difference]: With dead ends: 86 [2025-03-08 13:40:51,178 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 13:40:51,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:51,182 INFO L435 NwaCegarLoop]: 60 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, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:51,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:40:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 13:40:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 13:40:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 13:40:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2025-03-08 13:40:51,205 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 92 [2025-03-08 13:40:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:51,205 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2025-03-08 13:40:51,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 13:40:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2025-03-08 13:40:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 13:40:51,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:51,208 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:51,219 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:40:51,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:51,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 507739090, now seen corresponding path program 1 times [2025-03-08 13:40:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:40:51,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218973688] [2025-03-08 13:40:51,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:51,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:51,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:40:51,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:40:51,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:40:51,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:40:51,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:40:51,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:51,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:51,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 13:40:51,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:40:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 13:40:51,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:40:51,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:40:51,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218973688] [2025-03-08 13:40:51,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218973688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:51,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:51,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:40:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678573676] [2025-03-08 13:40:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:51,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:40:51,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:40:51,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:40:51,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:40:51,815 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 13:40:53,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:40:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:53,292 INFO L93 Difference]: Finished difference Result 112 states and 159 transitions. [2025-03-08 13:40:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:40:53,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-03-08 13:40:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:53,294 INFO L225 Difference]: With dead ends: 112 [2025-03-08 13:40:53,294 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 13:40:53,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:40:53,295 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 51 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:53,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 198 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 13:40:53,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 13:40:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2025-03-08 13:40:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 13:40:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2025-03-08 13:40:53,306 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 92 [2025-03-08 13:40:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:53,307 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2025-03-08 13:40:53,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 13:40:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2025-03-08 13:40:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 13:40:53,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:53,310 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:53,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 13:40:53,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:53,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:53,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:53,516 INFO L85 PathProgramCache]: Analyzing trace with hash 536368241, now seen corresponding path program 1 times [2025-03-08 13:40:53,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:40:53,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93541427] [2025-03-08 13:40:53,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:53,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:53,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:40:53,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:40:53,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:40:53,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:40:53,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:40:53,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:53,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:53,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 13:40:53,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:42:11,433 WARN L286 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:42:19,493 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:42:24,975 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)