./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.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 c89635c86a425cde697e700fe2c31fd3c6219e51225ce6611bf5868dd9f869f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:27:49,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:27:50,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:27:50,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:27:50,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:27:50,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:27:50,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:27:50,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:27:50,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:27:50,027 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:27:50,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:27:50,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:27:50,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:27:50,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:27:50,028 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:27:50,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:27:50,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:27:50,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:27:50,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:27:50,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:27:50,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:27:50,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:27:50,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:27:50,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:27:50,029 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:27:50,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:27:50,029 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:27:50,029 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:27:50,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:27:50,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:27:50,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:27:50,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:27:50,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:27:50,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:27:50,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:27:50,030 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:27:50,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:27:50,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:27:50,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:27:50,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:27:50,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:27:50,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:27:50,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:27:50,030 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 -> c89635c86a425cde697e700fe2c31fd3c6219e51225ce6611bf5868dd9f869f8 [2025-03-03 22:27:50,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:27:50,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:27:50,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:27:50,236 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:27:50,236 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:27:50,237 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-7.i [2025-03-03 22:27:51,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d31ac0f5/5b2aa9e0600245a8a98fc6aed5a0d719/FLAG939ad0f27 [2025-03-03 22:27:51,616 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:27:51,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.i [2025-03-03 22:27:51,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d31ac0f5/5b2aa9e0600245a8a98fc6aed5a0d719/FLAG939ad0f27 [2025-03-03 22:27:51,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d31ac0f5/5b2aa9e0600245a8a98fc6aed5a0d719 [2025-03-03 22:27:51,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:27:51,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:27:51,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:27:51,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:27:51,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:27:51,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:27:51" (1/1) ... [2025-03-03 22:27:51,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53da7ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:51, skipping insertion in model container [2025-03-03 22:27:51,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:27:51" (1/1) ... [2025-03-03 22:27:51,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:27:52,041 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-7.i[916,929] [2025-03-03 22:27:52,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:27:52,085 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:27:52,091 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-7.i[916,929] [2025-03-03 22:27:52,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:27:52,123 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:27:52,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52 WrapperNode [2025-03-03 22:27:52,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:27:52,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:27:52,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:27:52,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:27:52,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,150 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-03-03 22:27:52,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:27:52,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:27:52,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:27:52,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:27:52,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,170 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:27:52,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:27:52,178 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:27:52,178 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:27:52,178 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:27:52,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (1/1) ... [2025-03-03 22:27:52,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:27:52,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:27:52,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:27:52,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:27:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:27:52,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:27:52,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:27:52,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:27:52,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:27:52,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:27:52,288 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:27:52,290 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:27:52,477 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:27:52,478 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:27:52,484 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:27:52,485 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:27:52,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:27:52 BoogieIcfgContainer [2025-03-03 22:27:52,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:27:52,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:27:52,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:27:52,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:27:52,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:27:51" (1/3) ... [2025-03-03 22:27:52,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79176d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:27:52, skipping insertion in model container [2025-03-03 22:27:52,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:52" (2/3) ... [2025-03-03 22:27:52,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79176d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:27:52, skipping insertion in model container [2025-03-03 22:27:52,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:27:52" (3/3) ... [2025-03-03 22:27:52,491 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-7.i [2025-03-03 22:27:52,500 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:27:52,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-7.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:27:52,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:27:52,551 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;@5ab79e9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:27:52,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:27:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:27:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 22:27:52,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:27:52,563 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:27:52,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:27:52,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:27:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash -154590429, now seen corresponding path program 1 times [2025-03-03 22:27:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:27:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258021895] [2025-03-03 22:27:52,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:27:52,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:27:52,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:27:52,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:27:52,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:27:52,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:27:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 22:27:52,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:27:52,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258021895] [2025-03-03 22:27:52,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258021895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:27:52,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750593078] [2025-03-03 22:27:52,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:27:52,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:27:52,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:27:52,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:27:52,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:27:52,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:27:52,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:27:52,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:27:52,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:27:52,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:27:52,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:27:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 22:27:52,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:27:52,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750593078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:27:52,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:27:52,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:27:52,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941404837] [2025-03-03 22:27:52,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:27:52,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:27:52,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:27:52,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:27:52,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:27:52,887 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:27:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:27:52,899 INFO L93 Difference]: Finished difference Result 82 states and 135 transitions. [2025-03-03 22:27:52,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:27:52,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-03 22:27:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:27:52,904 INFO L225 Difference]: With dead ends: 82 [2025-03-03 22:27:52,904 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 22:27:52,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:27:52,908 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:27:52,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:27:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 22:27:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-03 22:27:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:27:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-03-03 22:27:52,933 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 79 [2025-03-03 22:27:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:27:52,934 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-03-03 22:27:52,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:27:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-03-03 22:27:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 22:27:52,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:27:52,937 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:27:52,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:27:53,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:27:53,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:27:53,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:27:53,140 INFO L85 PathProgramCache]: Analyzing trace with hash 287387521, now seen corresponding path program 1 times [2025-03-03 22:27:53,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:27:53,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637325960] [2025-03-03 22:27:53,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:27:53,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:27:53,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:27:53,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:27:53,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:27:53,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:27:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285278422] [2025-03-03 22:27:53,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:27:53,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:27:53,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:27:53,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:27:53,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:27:53,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:27:53,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:27:53,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:27:53,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:27:53,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:27:53,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:27:53,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:27:53,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:27:53,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:27:53,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:27:53,411 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:27:53,411 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:27:53,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 22:27:53,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 22:27:53,619 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 22:27:53,672 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:27:53,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:27:53 BoogieIcfgContainer [2025-03-03 22:27:53,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:27:53,675 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:27:53,675 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:27:53,675 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:27:53,675 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:27:52" (3/4) ... [2025-03-03 22:27:53,676 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:27:53,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:27:53,678 INFO L158 Benchmark]: Toolchain (without parser) took 1731.23ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 119.6MB in the end (delta: 4.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2025-03-03 22:27:53,678 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:27:53,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.51ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 111.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:27:53,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.90ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 108.9MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:27:53,678 INFO L158 Benchmark]: Boogie Preprocessor took 26.80ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 106.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:27:53,679 INFO L158 Benchmark]: IcfgBuilder took 307.38ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 90.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:27:53,679 INFO L158 Benchmark]: TraceAbstraction took 1187.36ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 119.6MB in the end (delta: -30.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2025-03-03 22:27:53,679 INFO L158 Benchmark]: Witness Printer took 2.30ms. Allocated memory is still 167.8MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:27:53,681 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.18ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.51ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 111.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.90ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 108.9MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.80ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 106.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.38ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 90.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1187.36ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 119.6MB in the end (delta: -30.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * Witness Printer took 2.30ms. Allocated memory is still 167.8MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] float var_1_3 = 8.2; [L24] float var_1_4 = 1000000000.4; [L25] unsigned char var_1_6 = 4; [L26] double var_1_7 = 0.2; [L27] unsigned char var_1_8 = 0; [L28] unsigned short int var_1_9 = 32; [L29] unsigned char var_1_10 = 1; [L30] double var_1_11 = 127.5; [L31] unsigned long int var_1_12 = 5; [L32] double last_1_var_1_7 = 0.2; [L33] unsigned long int last_1_var_1_12 = 5; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_3=41/5, var_1_4=5000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L89] last_1_var_1_7 = var_1_7 [L90] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_3=41/5, var_1_4=5000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L68] var_1_3 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_4=5000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_4=5000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L69] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_4=5000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L70] var_1_4 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L71] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_7=1/5, var_1_8=0, var_1_9=32] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_7=1/5, var_1_8=0, var_1_9=32] [L74] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=32] [L74] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=32] [L75] var_1_8 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_9=32] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_9=32] [L77] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=32] [L77] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=32] [L78] var_1_9 = __VERIFIER_nondet_ushort() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0] [L80] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0] [L80] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0] [L81] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L81] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L85] var_1_11 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L86] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=1, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L101] RET updateVariables() [L102] CALL step() [L37] COND FALSE !(! (last_1_var_1_7 <= (var_1_3 - var_1_4))) [L44] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=254, var_1_6=254, var_1_7=1/5, var_1_8=0, var_1_9=254] [L46] COND FALSE !(var_1_8 || ((var_1_6 / var_1_9) >= var_1_1)) [L53] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=5, var_1_1=254, var_1_6=254, var_1_7=2, var_1_8=0, var_1_9=254] [L55] COND FALSE !(\read(var_1_8)) [L64] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=254, var_1_1=254, var_1_6=254, var_1_7=2, var_1_8=0, var_1_9=254] [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return (((! (last_1_var_1_7 <= (var_1_3 - var_1_4))) ? ((-1 < last_1_var_1_12) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_8 || ((var_1_6 / var_1_9) >= var_1_1)) ? ((var_1_8 && var_1_10) ? (var_1_7 == ((double) var_1_11)) : (var_1_7 == ((double) var_1_11))) : (var_1_7 == ((double) var_1_11)))) && (var_1_8 ? ((var_1_10 && (var_1_4 <= var_1_7)) ? ((((((var_1_4) > (var_1_11)) ? (var_1_4) : (var_1_11))) > var_1_7) ? (var_1_12 == ((unsigned long int) ((((((3725801564u - var_1_6) - var_1_1)) > (var_1_9)) ? (((3725801564u - var_1_6) - var_1_1)) : (var_1_9))))) : (var_1_12 == ((unsigned long int) var_1_6))) : 1) : (var_1_12 == ((unsigned long int) var_1_6))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=254, var_1_1=254, var_1_6=254, var_1_7=2, var_1_8=0, var_1_9=254] [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=254, var_1_1=254, var_1_6=254, var_1_7=2, var_1_8=0, var_1_9=254] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=254, var_1_1=254, var_1_6=254, var_1_7=2, var_1_8=0, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 58 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 506/528 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:27:53,695 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-7.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 c89635c86a425cde697e700fe2c31fd3c6219e51225ce6611bf5868dd9f869f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:27:55,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:27:55,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:27:55,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:27:55,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:27:55,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:27:55,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:27:55,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:27:55,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:27:55,542 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:27:55,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:27:55,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:27:55,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:27:55,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:27:55,542 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:27:55,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:27:55,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:27:55,543 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:27:55,544 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:27:55,544 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:27:55,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:27:55,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:27:55,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:27:55,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:27:55,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:27:55,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:27:55,544 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:27:55,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:27:55,545 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:27:55,545 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:27:55,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:27:55,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:27:55,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:27:55,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:27:55,545 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 -> c89635c86a425cde697e700fe2c31fd3c6219e51225ce6611bf5868dd9f869f8 [2025-03-03 22:27:55,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:27:55,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:27:55,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:27:55,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:27:55,787 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:27:55,788 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-7.i [2025-03-03 22:27:56,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b44f2d4/a4ddcd39ec6f4f45942f284a542aa31a/FLAG734c97e58 [2025-03-03 22:27:57,104 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:27:57,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.i [2025-03-03 22:27:57,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b44f2d4/a4ddcd39ec6f4f45942f284a542aa31a/FLAG734c97e58 [2025-03-03 22:27:57,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b44f2d4/a4ddcd39ec6f4f45942f284a542aa31a [2025-03-03 22:27:57,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:27:57,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:27:57,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:27:57,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:27:57,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:27:57,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d7cef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57, skipping insertion in model container [2025-03-03 22:27:57,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:27:57,562 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-7.i[916,929] [2025-03-03 22:27:57,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:27:57,605 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:27:57,613 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-7.i[916,929] [2025-03-03 22:27:57,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:27:57,644 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:27:57,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57 WrapperNode [2025-03-03 22:27:57,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:27:57,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:27:57,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:27:57,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:27:57,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,674 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-03-03 22:27:57,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:27:57,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:27:57,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:27:57,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:27:57,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,698 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:27:57,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:27:57,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:27:57,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:27:57,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:27:57,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (1/1) ... [2025-03-03 22:27:57,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:27:57,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:27:57,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:27:57,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:27:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:27:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:27:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:27:57,763 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:27:57,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:27:57,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:27:57,821 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:27:57,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:27:58,685 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:27:58,685 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:27:58,693 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:27:58,693 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:27:58,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:27:58 BoogieIcfgContainer [2025-03-03 22:27:58,693 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:27:58,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:27:58,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:27:58,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:27:58,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:27:57" (1/3) ... [2025-03-03 22:27:58,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a519952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:27:58, skipping insertion in model container [2025-03-03 22:27:58,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:27:57" (2/3) ... [2025-03-03 22:27:58,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a519952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:27:58, skipping insertion in model container [2025-03-03 22:27:58,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:27:58" (3/3) ... [2025-03-03 22:27:58,700 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-7.i [2025-03-03 22:27:58,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:27:58,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-7.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:27:58,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:27:58,751 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;@435904da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:27:58,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:27:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:27:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 22:27:58,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:27:58,759 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:27:58,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:27:58,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:27:58,763 INFO L85 PathProgramCache]: Analyzing trace with hash -154590429, now seen corresponding path program 1 times [2025-03-03 22:27:58,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:27:58,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622036123] [2025-03-03 22:27:58,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:27:58,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:27:58,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:27:58,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:27:58,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:27:58,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:27:58,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:27:58,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:27:58,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:27:58,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:27:58,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:27:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-03 22:27:58,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:27:58,995 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:27:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622036123] [2025-03-03 22:27:58,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622036123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:27:58,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:27:58,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:27:58,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604826102] [2025-03-03 22:27:58,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:27:59,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:27:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:27:59,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:27:59,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:27:59,014 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:27:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:27:59,027 INFO L93 Difference]: Finished difference Result 82 states and 135 transitions. [2025-03-03 22:27:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:27:59,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-03 22:27:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:27:59,032 INFO L225 Difference]: With dead ends: 82 [2025-03-03 22:27:59,032 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 22:27:59,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:27:59,035 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:27:59,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:27:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 22:27:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-03 22:27:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:27:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-03-03 22:27:59,058 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 79 [2025-03-03 22:27:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:27:59,058 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-03-03 22:27:59,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:27:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-03-03 22:27:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 22:27:59,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:27:59,061 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:27:59,068 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-03 22:27:59,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:27:59,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:27:59,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:27:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash 287387521, now seen corresponding path program 1 times [2025-03-03 22:27:59,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:27:59,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530101209] [2025-03-03 22:27:59,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:27:59,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:27:59,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:27:59,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:27:59,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:27:59,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 22:27:59,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 22:27:59,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:27:59,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:27:59,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 22:27:59,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:28:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 22:28:03,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:28:03,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:28:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530101209] [2025-03-03 22:28:03,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530101209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:28:03,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:28:03,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:28:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815056145] [2025-03-03 22:28:03,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:28:03,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:28:03,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:28:03,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:28:03,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:28:03,821 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:28:05,669 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2025-03-03 22:28:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 22:28:05,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2025-03-03 22:28:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:28:05,671 INFO L225 Difference]: With dead ends: 110 [2025-03-03 22:28:05,672 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 22:28:05,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-03-03 22:28:05,673 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 101 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:28:05,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 164 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 22:28:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 22:28:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2025-03-03 22:28:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 22:28:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2025-03-03 22:28:05,683 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 79 [2025-03-03 22:28:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:28:05,683 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2025-03-03 22:28:05,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2025-03-03 22:28:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 22:28:05,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:28:05,686 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:28:05,694 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-03 22:28:05,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:05,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:28:05,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:28:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1268519688, now seen corresponding path program 1 times [2025-03-03 22:28:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:28:05,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129654190] [2025-03-03 22:28:05,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:05,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:05,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:28:05,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:28:05,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 22:28:05,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 22:28:06,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 22:28:06,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:06,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:06,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 22:28:06,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:28:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:28:06,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:28:06,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:28:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129654190] [2025-03-03 22:28:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129654190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:28:06,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:28:06,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:28:06,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099712859] [2025-03-03 22:28:06,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:28:06,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:28:06,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:28:06,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:28:06,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:28:06,047 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:06,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:28:06,222 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2025-03-03 22:28:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:28:06,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2025-03-03 22:28:06,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:28:06,225 INFO L225 Difference]: With dead ends: 132 [2025-03-03 22:28:06,225 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 22:28:06,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:28:06,226 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:28:06,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:28:06,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 22:28:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2025-03-03 22:28:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:28:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2025-03-03 22:28:06,236 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 80 [2025-03-03 22:28:06,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:28:06,236 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2025-03-03 22:28:06,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2025-03-03 22:28:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 22:28:06,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:28:06,240 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:28:06,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 22:28:06,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:06,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:28:06,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:28:06,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1297148839, now seen corresponding path program 1 times [2025-03-03 22:28:06,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:28:06,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092155491] [2025-03-03 22:28:06,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:06,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:06,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:28:06,447 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:28:06,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 22:28:06,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 22:28:06,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 22:28:06,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:06,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:06,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 22:28:06,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:28:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 22:28:09,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:28:09,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:28:09,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092155491] [2025-03-03 22:28:09,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092155491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:28:09,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:28:09,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:28:09,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050187563] [2025-03-03 22:28:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:28:09,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:28:09,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:28:09,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:28:09,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:28:09,523 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:28:11,191 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2025-03-03 22:28:11,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 22:28:11,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2025-03-03 22:28:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:28:11,193 INFO L225 Difference]: With dead ends: 86 [2025-03-03 22:28:11,193 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 22:28:11,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-03 22:28:11,194 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 114 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:28:11,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 164 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 22:28:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 22:28:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2025-03-03 22:28:11,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 54 states have internal predecessors, (59), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:28:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2025-03-03 22:28:11,203 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 80 [2025-03-03 22:28:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:28:11,203 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2025-03-03 22:28:11,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2025-03-03 22:28:11,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 22:28:11,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:28:11,204 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:28:11,212 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 (5)] Ended with exit code 0 [2025-03-03 22:28:11,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:11,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:28:11,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:28:11,405 INFO L85 PathProgramCache]: Analyzing trace with hash 701789440, now seen corresponding path program 1 times [2025-03-03 22:28:11,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:28:11,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183495690] [2025-03-03 22:28:11,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:11,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:11,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:28:11,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:28:11,415 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 (6)] Waiting until timeout for monitored process [2025-03-03 22:28:11,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 22:28:11,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 22:28:11,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:11,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:11,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 22:28:11,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:28:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 22:28:15,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:28:15,359 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:28:15,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183495690] [2025-03-03 22:28:15,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183495690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:28:15,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:28:15,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:28:15,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583956934] [2025-03-03 22:28:15,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:28:15,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:28:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:28:15,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:28:15,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:28:15,361 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:28:22,007 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2025-03-03 22:28:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 22:28:22,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-03-03 22:28:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:28:22,009 INFO L225 Difference]: With dead ends: 113 [2025-03-03 22:28:22,009 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 22:28:22,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-03 22:28:22,010 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 88 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:28:22,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 216 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 22:28:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 22:28:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2025-03-03 22:28:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 22:28:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2025-03-03 22:28:22,018 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 81 [2025-03-03 22:28:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:28:22,019 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2025-03-03 22:28:22,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2025-03-03 22:28:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 22:28:22,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:28:22,021 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:28:22,031 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 (6)] Ended with exit code 0 [2025-03-03 22:28:22,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:22,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:28:22,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:28:22,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1589293121, now seen corresponding path program 1 times [2025-03-03 22:28:22,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:28:22,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393601076] [2025-03-03 22:28:22,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:22,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:22,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:28:22,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:28:22,226 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 (7)] Waiting until timeout for monitored process [2025-03-03 22:28:22,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 22:28:22,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 22:28:22,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:22,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:22,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 22:28:22,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:28:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 22:28:24,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:28:24,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:28:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393601076] [2025-03-03 22:28:24,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393601076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:28:24,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:28:24,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:28:24,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306999454] [2025-03-03 22:28:24,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:28:24,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:28:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:28:24,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:28:24,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:28:24,124 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:28:26,023 INFO L93 Difference]: Finished difference Result 188 states and 229 transitions. [2025-03-03 22:28:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 22:28:26,023 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-03-03 22:28:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:28:26,024 INFO L225 Difference]: With dead ends: 188 [2025-03-03 22:28:26,024 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 22:28:26,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-03 22:28:26,025 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:28:26,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 206 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 22:28:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 22:28:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2025-03-03 22:28:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 68 states have internal predecessors, (72), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 22:28:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2025-03-03 22:28:26,033 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 81 [2025-03-03 22:28:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:28:26,033 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2025-03-03 22:28:26,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2025-03-03 22:28:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 22:28:26,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:28:26,034 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:28:26,042 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 (7)] Ended with exit code 0 [2025-03-03 22:28:26,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:26,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:28:26,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:28:26,235 INFO L85 PathProgramCache]: Analyzing trace with hash 253915592, now seen corresponding path program 1 times [2025-03-03 22:28:26,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:28:26,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824578626] [2025-03-03 22:28:26,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:26,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:26,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:28:26,237 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:28:26,238 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 (8)] Waiting until timeout for monitored process [2025-03-03 22:28:26,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 22:28:26,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 22:28:26,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:26,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:26,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 22:28:26,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:28:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 22:28:33,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:28:33,666 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:28:33,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824578626] [2025-03-03 22:28:33,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824578626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:28:33,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:28:33,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:28:33,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178535527] [2025-03-03 22:28:33,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:28:33,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:28:33,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:28:33,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:28:33,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:28:33,667 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:28:42,711 INFO L93 Difference]: Finished difference Result 193 states and 230 transitions. [2025-03-03 22:28:42,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 22:28:42,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2025-03-03 22:28:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:28:42,715 INFO L225 Difference]: With dead ends: 193 [2025-03-03 22:28:42,715 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 22:28:42,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-03 22:28:42,717 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 74 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:28:42,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 231 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-03 22:28:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 22:28:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 22:28:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 22:28:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 22:28:42,718 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2025-03-03 22:28:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:28:42,718 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 22:28:42,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:28:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 22:28:42,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 22:28:42,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:28:42,731 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 (8)] Ended with exit code 0 [2025-03-03 22:28:42,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:42,926 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:28:42,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 22:28:48,685 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:28:48,692 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 22:28:48,692 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 22:28:48,692 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 22:28:48,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 22:28:48,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 22:28:48,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 22:28:48,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:28:48 BoogieIcfgContainer [2025-03-03 22:28:48,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:28:48,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:28:48,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:28:48,694 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:28:48,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:27:58" (3/4) ... [2025-03-03 22:28:48,696 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 22:28:48,699 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-03 22:28:48,701 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-03 22:28:48,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-03 22:28:48,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 22:28:48,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 22:28:48,748 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 22:28:48,749 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 22:28:48,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:28:48,750 INFO L158 Benchmark]: Toolchain (without parser) took 51287.48ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 92.3MB in the beginning and 433.3MB in the end (delta: -341.0MB). Peak memory consumption was 207.7MB. Max. memory is 16.1GB. [2025-03-03 22:28:48,750 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 62.8MB in the beginning and 62.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:28:48,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.23ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:28:48,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.23ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:28:48,751 INFO L158 Benchmark]: Boogie Preprocessor took 31.96ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:28:48,751 INFO L158 Benchmark]: IcfgBuilder took 985.92ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 61.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:28:48,751 INFO L158 Benchmark]: TraceAbstraction took 49998.28ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 60.3MB in the beginning and 441.6MB in the end (delta: -381.3MB). Peak memory consumption was 174.2MB. Max. memory is 16.1GB. [2025-03-03 22:28:48,751 INFO L158 Benchmark]: Witness Printer took 55.17ms. Allocated memory is still 671.1MB. Free memory was 441.6MB in the beginning and 433.3MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:28:48,752 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.18ms. Allocated memory is still 83.9MB. Free memory was 62.8MB in the beginning and 62.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.23ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.23ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.96ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 985.92ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 61.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 49998.28ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 60.3MB in the beginning and 441.6MB in the end (delta: -381.3MB). Peak memory consumption was 174.2MB. Max. memory is 16.1GB. * Witness Printer took 55.17ms. Allocated memory is still 671.1MB. Free memory was 441.6MB in the beginning and 433.3MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 485 mSDsluCounter, 1160 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 797 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1470 IncrementalHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 363 mSDtfsCounter, 1470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 63 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 562 NumberOfCodeBlocks, 562 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 2573 SizeOfPredicates, 50 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1848/1848 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 22:28:48,861 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 Writing output log to file Ultimate.log Result: TRUE