./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 02:46:52,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:46:52,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:46:52,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:46:52,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:46:52,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:46:52,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:46:52,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:46:52,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:46:52,481 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:46:52,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:46:52,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:46:52,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:46:52,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:46:52,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:46:52,483 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:52,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:46:52,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:46:52,484 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-17 02:46:52,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:46:52,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:46:52,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:46:52,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:46:52,761 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:46:52,762 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-17 02:46:53,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69918a833/516c292a5644474d8b3d33c20d7d6ee2/FLAG28b5b7d4f [2025-03-17 02:46:54,078 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:46:54,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.i [2025-03-17 02:46:54,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69918a833/516c292a5644474d8b3d33c20d7d6ee2/FLAG28b5b7d4f [2025-03-17 02:46:54,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69918a833/516c292a5644474d8b3d33c20d7d6ee2 [2025-03-17 02:46:54,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:46:54,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:46:54,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:46:54,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:46:54,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:46:54,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dd392b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54, skipping insertion in model container [2025-03-17 02:46:54,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:46:54,568 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-17 02:46:54,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:46:54,617 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:46:54,626 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-17 02:46:54,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:46:54,662 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:46:54,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54 WrapperNode [2025-03-17 02:46:54,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:46:54,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:46:54,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:46:54,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:46:54,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,698 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-03-17 02:46:54,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:46:54,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:46:54,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:46:54,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:46:54,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,718 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-17 02:46:54,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:46:54,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:46:54,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:46:54,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:46:54,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (1/1) ... [2025-03-17 02:46:54,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:54,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:54,758 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-17 02:46:54,763 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-17 02:46:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:46:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:46:54,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:46:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:46:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:46:54,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:46:54,827 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:46:54,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:46:55,007 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 02:46:55,008 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:46:55,018 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:46:55,018 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:46:55,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:55 BoogieIcfgContainer [2025-03-17 02:46:55,018 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:46:55,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:46:55,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:46:55,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:46:55,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:46:54" (1/3) ... [2025-03-17 02:46:55,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7344c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:46:55, skipping insertion in model container [2025-03-17 02:46:55,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:54" (2/3) ... [2025-03-17 02:46:55,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7344c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:46:55, skipping insertion in model container [2025-03-17 02:46:55,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:55" (3/3) ... [2025-03-17 02:46:55,026 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-7.i [2025-03-17 02:46:55,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:46:55,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-7.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:46:55,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:46:55,080 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;@69e9bd35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:46:55,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:46:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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-17 02:46:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 02:46:55,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:55,088 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] [2025-03-17 02:46:55,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:55,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1643229127, now seen corresponding path program 1 times [2025-03-17 02:46:55,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:55,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482845606] [2025-03-17 02:46:55,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:55,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:55,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:46:55,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:46:55,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:55,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:55,272 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-17 02:46:55,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482845606] [2025-03-17 02:46:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482845606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:46:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533443784] [2025-03-17 02:46:55,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:55,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:46:55,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:55,276 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-17 02:46:55,277 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-17 02:46:55,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:46:55,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:46:55,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:55,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:55,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:46:55,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:46:55,381 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-17 02:46:55,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:46:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533443784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:55,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:46:55,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:46:55,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704570158] [2025-03-17 02:46:55,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:55,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:46:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:55,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:46:55,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:46:55,402 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-17 02:46:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:55,415 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2025-03-17 02:46:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:46:55,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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 75 [2025-03-17 02:46:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:55,421 INFO L225 Difference]: With dead ends: 75 [2025-03-17 02:46:55,421 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 02:46:55,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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-17 02:46:55,425 INFO L435 NwaCegarLoop]: 54 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, 54 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-17 02:46:55,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:46:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 02:46:55,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 02:46:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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-17 02:46:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2025-03-17 02:46:55,457 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 75 [2025-03-17 02:46:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:55,457 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2025-03-17 02:46:55,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-17 02:46:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2025-03-17 02:46:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 02:46:55,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:55,461 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] [2025-03-17 02:46:55,469 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-17 02:46:55,662 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-17 02:46:55,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:55,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1806196823, now seen corresponding path program 1 times [2025-03-17 02:46:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:55,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395474811] [2025-03-17 02:46:55,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:55,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:55,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:46:55,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:46:55,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:55,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:46:55,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541850297] [2025-03-17 02:46:55,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:55,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:46:55,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:55,746 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-17 02:46:55,748 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-17 02:46:55,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:46:55,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:46:55,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:55,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:46:55,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:46:55,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:46:55,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:46:55,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:55,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:46:55,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:46:55,920 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:46:55,921 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:46:55,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 02:46:56,123 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-17 02:46:56,129 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 02:46:56,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:46:56,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:46:56 BoogieIcfgContainer [2025-03-17 02:46:56,197 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:46:56,198 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:46:56,198 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:46:56,198 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:46:56,198 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:55" (3/4) ... [2025-03-17 02:46:56,200 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:46:56,201 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:46:56,206 INFO L158 Benchmark]: Toolchain (without parser) took 1761.96ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 35.2MB in the end (delta: 87.9MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-17 02:46:56,206 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:46:56,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.89ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 110.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:46:56,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.36ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 108.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:46:56,206 INFO L158 Benchmark]: Boogie Preprocessor took 25.84ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 105.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:46:56,206 INFO L158 Benchmark]: IcfgBuilder took 288.55ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 89.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:46:56,207 INFO L158 Benchmark]: TraceAbstraction took 1176.57ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 35.6MB in the end (delta: 53.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 02:46:56,207 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 167.8MB. Free memory was 35.6MB in the beginning and 35.2MB in the end (delta: 413.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:46:56,208 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.89ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 110.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.36ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 108.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.84ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 105.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 288.55ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 89.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1176.57ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 35.6MB in the end (delta: 53.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 167.8MB. Free memory was 35.6MB in the beginning and 35.2MB in the end (delta: 413.9kB). 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 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 37. 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; [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 [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=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] [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=4, 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=4, 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=4, 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=4, 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=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] [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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=2] [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=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=2] [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=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=4, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=2] [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=4, var_1_6=4, var_1_7=2, var_1_8=0, var_1_9=2] [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=4, var_1_1=4, var_1_6=4, var_1_7=2, var_1_8=0, var_1_9=2] [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))) ; [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=4, var_1_1=4, var_1_6=4, var_1_7=2, var_1_8=0, var_1_9=2] [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=4, var_1_1=4, var_1_6=4, var_1_7=2, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 71 edges, 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, 54 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, 54 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 191 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-17 02:46:56,229 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-?-8fc3dc6-m [2025-03-17 02:46:58,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:46:58,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:46:58,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:46:58,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:46:58,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:46:58,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:46:58,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:46:58,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:46:58,390 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:46:58,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:46:58,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:46:58,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:46:58,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:46:58,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:46:58,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:46:58,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:46:58,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:46:58,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:46:58,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:46:58,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:46:58,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:46:58,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:58,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:46:58,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:46:58,405 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:46:58,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:46:58,405 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:46:58,405 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:46:58,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:46:58,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:46:58,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:46:58,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:46:58,405 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-17 02:46:58,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:46:58,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:46:58,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:46:58,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:46:58,668 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:46:58,671 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-17 02:46:59,938 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57bf41819/623661bc5d8b40fda60ed0e809a0a204/FLAG2933ed4c5 [2025-03-17 02:47:00,210 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:47:00,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.i [2025-03-17 02:47:00,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57bf41819/623661bc5d8b40fda60ed0e809a0a204/FLAG2933ed4c5 [2025-03-17 02:47:00,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57bf41819/623661bc5d8b40fda60ed0e809a0a204 [2025-03-17 02:47:00,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:47:00,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:47:00,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:47:00,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:47:00,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:47:00,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:00" (1/1) ... [2025-03-17 02:47:00,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718f4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:00, skipping insertion in model container [2025-03-17 02:47:00,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:00" (1/1) ... [2025-03-17 02:47:00,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:47:00,967 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-17 02:47:01,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:47:01,065 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:47:01,074 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-17 02:47:01,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:47:01,106 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:47:01,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01 WrapperNode [2025-03-17 02:47:01,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:47:01,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:47:01,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:47:01,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:47:01,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,140 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-03-17 02:47:01,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:47:01,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:47:01,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:47:01,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:47:01,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,178 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-17 02:47:01,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:47:01,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:47:01,204 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:47:01,204 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:47:01,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (1/1) ... [2025-03-17 02:47:01,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:47:01,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:47:01,234 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-17 02:47:01,237 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-17 02:47:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:47:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:47:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:47:01,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:47:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:47:01,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:47:01,323 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:47:01,325 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:47:02,394 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 02:47:02,394 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:47:02,412 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:47:02,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:47:02,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:02 BoogieIcfgContainer [2025-03-17 02:47:02,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:47:02,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:47:02,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:47:02,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:47:02,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:47:00" (1/3) ... [2025-03-17 02:47:02,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b5594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:02, skipping insertion in model container [2025-03-17 02:47:02,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:01" (2/3) ... [2025-03-17 02:47:02,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b5594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:02, skipping insertion in model container [2025-03-17 02:47:02,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:02" (3/3) ... [2025-03-17 02:47:02,431 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-7.i [2025-03-17 02:47:02,445 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:47:02,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-7.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:47:02,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:47:02,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;@195c305a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:47:02,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:47:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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-17 02:47:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 02:47:02,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:02,574 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] [2025-03-17 02:47:02,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:02,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1643229127, now seen corresponding path program 1 times [2025-03-17 02:47:02,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184790887] [2025-03-17 02:47:02,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:02,604 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-17 02:47:02,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:02,613 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-17 02:47:02,615 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-17 02:47:02,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:47:02,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:47:02,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:02,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:02,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:47:02,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:02,901 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-17 02:47:02,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:02,902 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184790887] [2025-03-17 02:47:02,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184790887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:02,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:02,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:47:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61603511] [2025-03-17 02:47:02,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:02,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:47:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:02,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:47:02,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:47:02,952 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-17 02:47:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:02,986 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2025-03-17 02:47:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:47:02,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 75 [2025-03-17 02:47:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:02,993 INFO L225 Difference]: With dead ends: 75 [2025-03-17 02:47:02,993 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 02:47:02,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-17 02:47:02,999 INFO L435 NwaCegarLoop]: 54 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, 54 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-17 02:47:03,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:47:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 02:47:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 02:47:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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-17 02:47:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2025-03-17 02:47:03,084 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 75 [2025-03-17 02:47:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:03,085 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2025-03-17 02:47:03,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-17 02:47:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2025-03-17 02:47:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 02:47:03,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:03,091 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] [2025-03-17 02:47:03,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:47:03,292 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-17 02:47:03,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:03,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:03,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1806196823, now seen corresponding path program 1 times [2025-03-17 02:47:03,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560938125] [2025-03-17 02:47:03,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:03,295 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-17 02:47:03,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:03,297 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-17 02:47:03,299 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-17 02:47:03,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 02:47:03,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 02:47:03,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:03,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:03,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:47:03,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:08,534 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-17 02:47:08,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:08,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560938125] [2025-03-17 02:47:08,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560938125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:08,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:08,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:47:08,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35592622] [2025-03-17 02:47:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:08,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:47:08,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:08,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:47:08,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:47:08,538 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-17 02:47:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:11,024 INFO L93 Difference]: Finished difference Result 101 states and 138 transitions. [2025-03-17 02:47:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 02:47:11,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 75 [2025-03-17 02:47:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:11,027 INFO L225 Difference]: With dead ends: 101 [2025-03-17 02:47:11,027 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 02:47:11,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-17 02:47:11,028 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 68 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:11,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 129 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 02:47:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 02:47:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2025-03-17 02:47:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 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-17 02:47:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2025-03-17 02:47:11,041 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 75 [2025-03-17 02:47:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:11,043 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2025-03-17 02:47:11,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-17 02:47:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2025-03-17 02:47:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 02:47:11,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:11,044 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] [2025-03-17 02:47:11,053 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-17 02:47:11,244 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-17 02:47:11,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:11,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash -126899561, now seen corresponding path program 1 times [2025-03-17 02:47:11,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:11,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696512729] [2025-03-17 02:47:11,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:11,248 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-17 02:47:11,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:11,250 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-17 02:47:11,252 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-17 02:47:11,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 02:47:11,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 02:47:11,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:11,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:11,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 02:47:11,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:11,482 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-17 02:47:11,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:11,482 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:11,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696512729] [2025-03-17 02:47:11,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696512729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:11,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:11,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:47:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084714564] [2025-03-17 02:47:11,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:11,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:47:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:11,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:47:11,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:47:11,483 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-17 02:47:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:11,726 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2025-03-17 02:47:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:47:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 76 [2025-03-17 02:47:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:11,730 INFO L225 Difference]: With dead ends: 121 [2025-03-17 02:47:11,730 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 02:47:11,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-17 02:47:11,731 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 111 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-17 02:47:11,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 111 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:47:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 02:47:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2025-03-17 02:47:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 49 states have internal predecessors, (55), 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-17 02:47:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2025-03-17 02:47:11,748 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 76 [2025-03-17 02:47:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:11,750 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2025-03-17 02:47:11,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-17 02:47:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2025-03-17 02:47:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 02:47:11,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:11,752 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] [2025-03-17 02:47:11,766 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-17 02:47:11,953 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-17 02:47:11,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:11,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash -125976040, now seen corresponding path program 1 times [2025-03-17 02:47:11,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:11,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15664923] [2025-03-17 02:47:11,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:11,954 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-17 02:47:11,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:11,957 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-17 02:47:11,957 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-17 02:47:11,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 02:47:12,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 02:47:12,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:12,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:12,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:47:12,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:15,465 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-17 02:47:15,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:15,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15664923] [2025-03-17 02:47:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15664923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:15,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:15,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:47:15,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102021445] [2025-03-17 02:47:15,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:15,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:47:15,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:15,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:47:15,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:47:15,467 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-17 02:47:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:17,735 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2025-03-17 02:47:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 02:47:17,738 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 76 [2025-03-17 02:47:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:17,739 INFO L225 Difference]: With dead ends: 78 [2025-03-17 02:47:17,739 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 02:47:17,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-17 02:47:17,747 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 73 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:17,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 117 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 02:47:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 02:47:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2025-03-17 02:47:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 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-17 02:47:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2025-03-17 02:47:17,771 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 76 [2025-03-17 02:47:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:17,772 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2025-03-17 02:47:17,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-17 02:47:17,772 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2025-03-17 02:47:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 02:47:17,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:17,773 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] [2025-03-17 02:47:17,783 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-17 02:47:17,973 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-17 02:47:17,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:17,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash 362125546, now seen corresponding path program 1 times [2025-03-17 02:47:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:17,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164357125] [2025-03-17 02:47:17,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:17,976 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-17 02:47:17,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:17,978 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-17 02:47:17,980 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-17 02:47:18,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 02:47:18,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 02:47:18,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:18,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:18,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 02:47:18,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:23,524 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-17 02:47:23,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:23,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164357125] [2025-03-17 02:47:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164357125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:23,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:23,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:47:23,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592431947] [2025-03-17 02:47:23,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:23,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:47:23,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:23,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:47:23,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:47:23,526 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-17 02:47:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:34,188 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2025-03-17 02:47:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 02:47:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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 77 [2025-03-17 02:47:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:34,195 INFO L225 Difference]: With dead ends: 102 [2025-03-17 02:47:34,195 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 02:47:34,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:47:34,200 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:34,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 159 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-03-17 02:47:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 02:47:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2025-03-17 02:47:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 57 states have internal predecessors, (63), 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-17 02:47:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2025-03-17 02:47:34,211 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 77 [2025-03-17 02:47:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:34,212 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2025-03-17 02:47:34,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-17 02:47:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2025-03-17 02:47:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 02:47:34,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:34,213 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] [2025-03-17 02:47:34,222 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-17 02:47:34,414 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-17 02:47:34,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:34,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash 390754697, now seen corresponding path program 1 times [2025-03-17 02:47:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:34,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334026875] [2025-03-17 02:47:34,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:34,417 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-17 02:47:34,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:34,419 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-17 02:47:34,421 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-17 02:47:34,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 02:47:34,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 02:47:34,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:34,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:34,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:47:34,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:37,011 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-17 02:47:37,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:37,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:37,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334026875] [2025-03-17 02:47:37,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334026875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:37,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:37,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:47:37,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956956364] [2025-03-17 02:47:37,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:37,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:47:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:37,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:47:37,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:47:37,016 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-17 02:47:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:39,983 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2025-03-17 02:47:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 02:47:39,987 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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 77 [2025-03-17 02:47:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:39,988 INFO L225 Difference]: With dead ends: 171 [2025-03-17 02:47:39,988 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 02:47:39,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:47:39,989 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 89 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:39,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 136 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 02:47:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 02:47:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2025-03-17 02:47:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 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-17 02:47:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2025-03-17 02:47:40,015 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 77 [2025-03-17 02:47:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:40,015 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2025-03-17 02:47:40,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-17 02:47:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2025-03-17 02:47:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 02:47:40,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:40,016 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] [2025-03-17 02:47:40,029 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-17 02:47:40,223 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-17 02:47:40,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:40,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1659871945, now seen corresponding path program 1 times [2025-03-17 02:47:40,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:40,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689432431] [2025-03-17 02:47:40,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:40,225 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-17 02:47:40,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:40,227 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-17 02:47:40,228 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-17 02:47:40,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 02:47:40,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 02:47:40,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:40,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:40,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 02:47:40,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:49,514 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-17 02:47:49,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:49,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:49,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689432431] [2025-03-17 02:47:49,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689432431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:49,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:49,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:47:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286182122] [2025-03-17 02:47:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:49,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:47:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:49,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:47:49,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:47:49,519 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-17 02:48:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:48:04,923 INFO L93 Difference]: Finished difference Result 175 states and 212 transitions. [2025-03-17 02:48:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 02:48:04,925 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 78 [2025-03-17 02:48:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:48:04,926 INFO L225 Difference]: With dead ends: 175 [2025-03-17 02:48:04,926 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 02:48:04,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:48:04,927 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 57 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-03-17 02:48:04,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 154 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2025-03-17 02:48:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 02:48:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 02:48:04,928 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-17 02:48:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 02:48:04,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2025-03-17 02:48:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:48:04,928 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 02:48:04,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-17 02:48:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 02:48:04,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 02:48:04,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:48:04,940 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-17 02:48:05,133 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-17 02:48:05,135 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:48:05,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 02:48:11,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:48:11,388 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 02:48:11,389 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 02:48:11,389 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 02:48:11,389 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 02:48:11,389 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 02:48:11,389 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-17 02:48:11,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:48:11 BoogieIcfgContainer [2025-03-17 02:48:11,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:48:11,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:48:11,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:48:11,391 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:48:11,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:02" (3/4) ... [2025-03-17 02:48:11,394 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 02:48:11,399 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 02:48:11,404 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 02:48:11,404 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 02:48:11,404 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 02:48:11,404 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 02:48:11,467 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 02:48:11,468 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 02:48:11,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:48:11,468 INFO L158 Benchmark]: Toolchain (without parser) took 70821.04ms. Allocated memory was 117.4MB in the beginning and 687.9MB in the end (delta: 570.4MB). Free memory was 92.1MB in the beginning and 433.2MB in the end (delta: -341.1MB). Peak memory consumption was 224.4MB. Max. memory is 16.1GB. [2025-03-17 02:48:11,468 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 83.9MB. Free memory was 62.9MB in the beginning and 62.9MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:48:11,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.84ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.0MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:48:11,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.94ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:48:11,469 INFO L158 Benchmark]: Boogie Preprocessor took 55.62ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:48:11,469 INFO L158 Benchmark]: IcfgBuilder took 1211.97ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 61.2MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:48:11,469 INFO L158 Benchmark]: TraceAbstraction took 68975.66ms. Allocated memory was 117.4MB in the beginning and 687.9MB in the end (delta: 570.4MB). Free memory was 60.5MB in the beginning and 437.3MB in the end (delta: -376.8MB). Peak memory consumption was 190.9MB. Max. memory is 16.1GB. [2025-03-17 02:48:11,469 INFO L158 Benchmark]: Witness Printer took 76.63ms. Allocated memory is still 687.9MB. Free memory was 437.3MB in the beginning and 433.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:48:11,470 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.52ms. Allocated memory is still 83.9MB. Free memory was 62.9MB in the beginning and 62.9MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.84ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.0MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.94ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.62ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1211.97ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 61.2MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 68975.66ms. Allocated memory was 117.4MB in the beginning and 687.9MB in the end (delta: 570.4MB). Free memory was 60.5MB in the beginning and 437.3MB in the end (delta: -376.8MB). Peak memory consumption was 190.9MB. Max. memory is 16.1GB. * Witness Printer took 76.63ms. Allocated memory is still 687.9MB. Free memory was 437.3MB in the beginning and 433.2MB in the end (delta: 4.0MB). 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, 39 locations, 71 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.6s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 23.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 860 SdHoareTripleChecker+Invalid, 21.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 535 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1451 IncrementalHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 325 mSDtfsCounter, 1451 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 573 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, InterpolantAutomatonStates: 96, 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, 58 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 527 ConstructedInterpolants, 0 QuantifiedInterpolants, 2511 SizeOfPredicates, 50 NumberOfNonLiveVariables, 930 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-17 02:48:11,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE