./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.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 e93de99482d94814bb61a39ae8aebe1d7604ed02e49ddec9cbe7f761e760f5e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:23:10,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:23:10,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:23:10,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:23:10,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:23:10,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:23:10,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:23:10,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:23:10,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:23:10,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:23:10,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:23:10,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:23:10,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:23:10,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:23:10,778 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:23:10,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:23:10,779 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:23:10,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:23:10,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:23:10,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:23:10,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:23:10,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:23:10,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:23:10,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:23:10,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:23:10,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:23:10,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:23:10,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:23:10,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:23:10,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:23:10,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:23:10,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:23:10,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:23:10,781 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 -> e93de99482d94814bb61a39ae8aebe1d7604ed02e49ddec9cbe7f761e760f5e6 [2025-03-03 22:23:11,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:23:11,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:23:11,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:23:11,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:23:11,027 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:23:11,027 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-31.i [2025-03-03 22:23:12,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cb1fbed/cd706f20f63f40abbebc345e3f9b1fab/FLAG53b04a9fa [2025-03-03 22:23:12,442 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:23:12,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i [2025-03-03 22:23:12,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cb1fbed/cd706f20f63f40abbebc345e3f9b1fab/FLAG53b04a9fa [2025-03-03 22:23:12,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cb1fbed/cd706f20f63f40abbebc345e3f9b1fab [2025-03-03 22:23:12,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:23:12,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:23:12,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:23:12,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:23:12,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:23:12,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12, skipping insertion in model container [2025-03-03 22:23:12,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:23:12,636 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-31.i[917,930] [2025-03-03 22:23:12,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:23:12,692 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:23:12,704 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-31.i[917,930] [2025-03-03 22:23:12,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:23:12,729 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:23:12,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12 WrapperNode [2025-03-03 22:23:12,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:23:12,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:23:12,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:23:12,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:23:12,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,763 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2025-03-03 22:23:12,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:23:12,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:23:12,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:23:12,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:23:12,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,785 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:23:12,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:23:12,793 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:23:12,793 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:23:12,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:23:12,794 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (1/1) ... [2025-03-03 22:23:12,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:23:12,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:23:12,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:23:12,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:23:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:23:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:23:12,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:23:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:23:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:23:12,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:23:12,906 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:23:12,908 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:23:13,094 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:23:13,095 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:23:13,102 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:23:13,104 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:23:13,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:23:13 BoogieIcfgContainer [2025-03-03 22:23:13,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:23:13,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:23:13,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:23:13,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:23:13,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:23:12" (1/3) ... [2025-03-03 22:23:13,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445d8ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:23:13, skipping insertion in model container [2025-03-03 22:23:13,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:12" (2/3) ... [2025-03-03 22:23:13,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445d8ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:23:13, skipping insertion in model container [2025-03-03 22:23:13,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:23:13" (3/3) ... [2025-03-03 22:23:13,114 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-31.i [2025-03-03 22:23:13,124 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:23:13,126 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-31.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:23:13,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:23:13,174 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;@798a95a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:23:13,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:23:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 22:23:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 22:23:13,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:23:13,188 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:23:13,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:23:13,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:23:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1023406542, now seen corresponding path program 1 times [2025-03-03 22:23:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:23:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384974312] [2025-03-03 22:23:13,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:23:13,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 22:23:13,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 22:23:13,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:13,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-03 22:23:13,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:23:13,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384974312] [2025-03-03 22:23:13,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384974312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:23:13,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609818218] [2025-03-03 22:23:13,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:13,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:23:13,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:23:13,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:23:13,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:23:13,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 22:23:13,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 22:23:13,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:13,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:13,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:23:13,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:23:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-03 22:23:13,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:23:13,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609818218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:23:13,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:23:13,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:23:13,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360714257] [2025-03-03 22:23:13,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:23:13,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:23:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:23:13,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:23:13,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:23:13,516 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 22:23:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:23:13,538 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2025-03-03 22:23:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:23:13,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2025-03-03 22:23:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:23:13,544 INFO L225 Difference]: With dead ends: 82 [2025-03-03 22:23:13,544 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 22:23:13,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:23:13,550 INFO L435 NwaCegarLoop]: 59 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, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:23:13,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:23:13,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 22:23:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-03 22:23:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 22:23:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-03-03 22:23:13,583 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 74 [2025-03-03 22:23:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:23:13,584 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-03 22:23:13,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 22:23:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2025-03-03 22:23:13,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 22:23:13,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:23:13,588 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:23:13,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:23:13,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:23:13,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:23:13,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:23:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1790245426, now seen corresponding path program 1 times [2025-03-03 22:23:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:23:13,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622109940] [2025-03-03 22:23:13,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:13,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:23:13,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 22:23:13,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 22:23:13,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:13,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:23:13,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062088451] [2025-03-03 22:23:13,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:13,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:23:13,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:23:13,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:23:13,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:23:13,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 22:23:14,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 22:23:14,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:14,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:23:14,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:23:14,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 22:23:14,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 22:23:14,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:23:14,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:23:14,071 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:23:14,072 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:23:14,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:23:14,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 22:23:14,277 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 22:23:14,311 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:23:14,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:23:14 BoogieIcfgContainer [2025-03-03 22:23:14,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:23:14,315 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:23:14,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:23:14,315 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:23:14,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:23:13" (3/4) ... [2025-03-03 22:23:14,317 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:23:14,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:23:14,318 INFO L158 Benchmark]: Toolchain (without parser) took 1811.94ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 90.2MB in the end (delta: 15.6MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2025-03-03 22:23:14,318 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:23:14,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.09ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:23:14,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.12ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:23:14,319 INFO L158 Benchmark]: Boogie Preprocessor took 28.00ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:23:14,319 INFO L158 Benchmark]: IcfgBuilder took 312.70ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 73.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:23:14,319 INFO L158 Benchmark]: TraceAbstraction took 1207.03ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 90.3MB in the end (delta: -16.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:23:14,320 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 90.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:23:14,321 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.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.09ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.12ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.00ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.70ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 73.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1207.03ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 90.3MB in the end (delta: -16.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 90.2MB in the end (delta: 41.6kB). 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 someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1107940323; [L25] unsigned char var_1_6 = 0; [L26] signed long int var_1_7 = 4; [L27] signed long int var_1_8 = -32; [L28] unsigned char var_1_9 = 64; [L29] unsigned char var_1_12 = 4; [L30] double var_1_13 = 0.97; [L31] double var_1_14 = 32.6; [L32] signed long int last_1_var_1_7 = 4; [L33] double last_1_var_1_13 = 0.97; VAL [isInitial=0, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L92] last_1_var_1_7 = var_1_7 [L93] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L74] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L75] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L75] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L76] var_1_3 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L77] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L78] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L78] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L82] var_1_8 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L83] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L84] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L84] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L87] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L87] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L89] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L104] RET updateVariables() [L105] CALL step() [L37] COND FALSE !(! (var_1_3 < (var_1_8 * last_1_var_1_7))) [L44] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=1] [L46] COND FALSE !(var_1_9 < var_1_9) [L49] var_1_7 = (var_1_9 - var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L51] COND FALSE !((var_1_9 + var_1_3) < var_1_9) [L62] var_1_13 = var_1_14 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L64] COND TRUE \read(var_1_2) [L65] var_1_1 = ((var_1_3 - var_1_9) - var_1_9) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_9) - var_1_9))) : ((var_1_6 && (var_1_3 < var_1_9)) ? (var_1_1 == ((signed long int) var_1_3)) : 1)) && ((var_1_9 < var_1_9) ? (var_1_7 == ((signed long int) (var_1_9 + var_1_9))) : (var_1_7 == ((signed long int) (var_1_9 - var_1_3))))) && ((! (var_1_3 < (var_1_8 * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? (var_1_6 ? (var_1_9 == ((unsigned char) var_1_12)) : 1) : 1) : (var_1_9 == ((unsigned char) var_1_12)))) && (((var_1_9 + var_1_3) < var_1_9) ? ((var_1_2 && var_1_6) ? (var_1_6 ? (var_1_13 == ((double) 0.8)) : (var_1_13 == ((double) var_1_14))) : (var_1_13 == ((double) var_1_14))) : (var_1_13 == ((double) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 59 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, 59 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 185 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:23:14,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.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 e93de99482d94814bb61a39ae8aebe1d7604ed02e49ddec9cbe7f761e760f5e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:23:16,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:23:16,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:23:16,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:23:16,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:23:16,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:23:16,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:23:16,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:23:16,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:23:16,273 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:23:16,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:23:16,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:23:16,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:23:16,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:23:16,275 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:23:16,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:23:16,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:23:16,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:23:16,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:23:16,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:23:16,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:23:16,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:23:16,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:23:16,276 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:23:16,276 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:23:16,276 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:23:16,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:23:16,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:23:16,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:23:16,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:23:16,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:23:16,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:23:16,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:23:16,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:23:16,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:23:16,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:23:16,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:23:16,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:23:16,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:23:16,278 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:23:16,278 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:23:16,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:23:16,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:23:16,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:23:16,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:23:16,278 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 -> e93de99482d94814bb61a39ae8aebe1d7604ed02e49ddec9cbe7f761e760f5e6 [2025-03-03 22:23:16,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:23:16,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:23:16,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:23:16,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:23:16,538 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:23:16,539 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-31.i [2025-03-03 22:23:17,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b281adacd/e7de925f3723467cbb687b1a053c1acf/FLAG0ec927b3b [2025-03-03 22:23:17,873 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:23:17,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i [2025-03-03 22:23:17,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b281adacd/e7de925f3723467cbb687b1a053c1acf/FLAG0ec927b3b [2025-03-03 22:23:17,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b281adacd/e7de925f3723467cbb687b1a053c1acf [2025-03-03 22:23:17,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:23:17,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:23:17,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:23:17,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:23:17,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:23:17,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:23:17" (1/1) ... [2025-03-03 22:23:17,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bd088c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:17, skipping insertion in model container [2025-03-03 22:23:17,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:23:17" (1/1) ... [2025-03-03 22:23:17,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:23:18,020 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-31.i[917,930] [2025-03-03 22:23:18,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:23:18,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:23:18,085 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-31.i[917,930] [2025-03-03 22:23:18,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:23:18,126 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:23:18,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18 WrapperNode [2025-03-03 22:23:18,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:23:18,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:23:18,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:23:18,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:23:18,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,156 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2025-03-03 22:23:18,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:23:18,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:23:18,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:23:18,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:23:18,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,172 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:23:18,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:23:18,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:23:18,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:23:18,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:23:18,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (1/1) ... [2025-03-03 22:23:18,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:23:18,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:23:18,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:23:18,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:23:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:23:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:23:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:23:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:23:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:23:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:23:18,282 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:23:18,284 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:23:18,541 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:23:18,541 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:23:18,547 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:23:18,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:23:18,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:23:18 BoogieIcfgContainer [2025-03-03 22:23:18,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:23:18,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:23:18,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:23:18,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:23:18,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:23:17" (1/3) ... [2025-03-03 22:23:18,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d86432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:23:18, skipping insertion in model container [2025-03-03 22:23:18,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:18" (2/3) ... [2025-03-03 22:23:18,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d86432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:23:18, skipping insertion in model container [2025-03-03 22:23:18,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:23:18" (3/3) ... [2025-03-03 22:23:18,555 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-31.i [2025-03-03 22:23:18,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:23:18,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-31.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:23:18,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:23:18,617 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;@3692ef67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:23:18,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:23:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 22:23:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 22:23:18,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:23:18,626 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:23:18,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:23:18,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:23:18,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1023406542, now seen corresponding path program 1 times [2025-03-03 22:23:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:23:18,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306376206] [2025-03-03 22:23:18,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:18,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:23:18,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:23:18,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:23:18,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:23:18,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 22:23:18,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 22:23:18,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:18,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:18,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:23:18,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:23:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-03 22:23:18,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:23:18,809 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:23:18,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306376206] [2025-03-03 22:23:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306376206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:23:18,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:23:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:23:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012593516] [2025-03-03 22:23:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:23:18,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:23:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:23:18,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:23:18,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:23:18,831 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 22:23:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:23:18,848 INFO L93 Difference]: Finished difference Result 81 states and 134 transitions. [2025-03-03 22:23:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:23:18,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2025-03-03 22:23:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:23:18,854 INFO L225 Difference]: With dead ends: 81 [2025-03-03 22:23:18,855 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 22:23:18,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:23:18,860 INFO L435 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:23:18,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:23:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 22:23:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-03 22:23:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 22:23:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-03-03 22:23:18,892 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 74 [2025-03-03 22:23:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:23:18,893 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-03-03 22:23:18,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 22:23:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-03-03 22:23:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 22:23:18,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:23:18,896 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:23:18,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:23:19,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:23:19,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:23:19,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:23:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1790245426, now seen corresponding path program 1 times [2025-03-03 22:23:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:23:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424028430] [2025-03-03 22:23:19,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:19,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:23:19,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:23:19,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:23:19,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:23:19,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 22:23:19,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 22:23:19,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:19,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:19,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 22:23:19,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:23:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-03 22:23:46,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:23:46,571 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:23:46,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424028430] [2025-03-03 22:23:46,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424028430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:23:46,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:23:46,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 22:23:46,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194886860] [2025-03-03 22:23:46,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:23:46,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:23:46,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:23:46,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:23:46,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:23:46,574 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 22:23:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:23:47,977 INFO L93 Difference]: Finished difference Result 113 states and 151 transitions. [2025-03-03 22:23:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 22:23:47,980 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2025-03-03 22:23:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:23:47,981 INFO L225 Difference]: With dead ends: 113 [2025-03-03 22:23:47,983 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 22:23:47,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-03-03 22:23:47,984 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 89 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:23:47,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 298 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 22:23:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 22:23:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 74. [2025-03-03 22:23:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 22:23:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2025-03-03 22:23:47,995 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 74 [2025-03-03 22:23:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:23:47,995 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2025-03-03 22:23:47,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 22:23:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2025-03-03 22:23:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 22:23:47,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:23:47,997 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:23:48,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 22:23:48,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:23:48,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:23:48,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:23:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash 424762678, now seen corresponding path program 1 times [2025-03-03 22:23:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:23:48,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101309469] [2025-03-03 22:23:48,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:48,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:23:48,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:23:48,202 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:23:48,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 22:23:48,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 22:23:48,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 22:23:48,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:48,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:48,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:23:48,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:23:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 22:23:48,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:23:48,406 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:23:48,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101309469] [2025-03-03 22:23:48,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101309469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:23:48,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [898775069] [2025-03-03 22:23:48,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:48,407 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:23:48,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:23:48,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:23:48,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-03 22:23:48,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 22:23:48,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 22:23:48,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:48,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:48,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:23:48,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:23:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 22:23:48,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:23:48,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [898775069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:23:48,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:23:48,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-03 22:23:48,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007553021] [2025-03-03 22:23:48,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:23:48,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:23:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:23:48,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:23:48,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:23:48,900 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 22:23:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:23:49,088 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2025-03-03 22:23:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:23:49,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2025-03-03 22:23:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:23:49,089 INFO L225 Difference]: With dead ends: 123 [2025-03-03 22:23:49,090 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 22:23:49,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:23:49,090 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:23:49,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:23:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 22:23:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-03 22:23:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 22:23:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2025-03-03 22:23:49,099 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 75 [2025-03-03 22:23:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:23:49,099 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2025-03-03 22:23:49,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 22:23:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2025-03-03 22:23:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 22:23:49,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:23:49,100 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:23:49,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-03 22:23:49,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-03 22:23:49,505 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 22:23:49,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:23:49,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:23:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash 425686199, now seen corresponding path program 1 times [2025-03-03 22:23:49,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:23:49,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677239830] [2025-03-03 22:23:49,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:49,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:23:49,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:23:49,509 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:23:49,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 22:23:49,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 22:23:49,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 22:23:49,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:49,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:49,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 22:23:49,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:24:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-03 22:24:46,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:24:46,692 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:24:46,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677239830] [2025-03-03 22:24:46,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677239830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:24:46,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:24:46,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 22:24:46,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951063995] [2025-03-03 22:24:46,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:24:46,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:24:46,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:24:46,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:24:46,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:24:46,694 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 22:24:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:24:47,815 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2025-03-03 22:24:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 22:24:47,816 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 75 [2025-03-03 22:24:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:24:47,817 INFO L225 Difference]: With dead ends: 119 [2025-03-03 22:24:47,817 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 22:24:47,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2025-03-03 22:24:47,818 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 123 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:24:47,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 268 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:24:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 22:24:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 83. [2025-03-03 22:24:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 22:24:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2025-03-03 22:24:47,832 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 75 [2025-03-03 22:24:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:24:47,832 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2025-03-03 22:24:47,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 22:24:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2025-03-03 22:24:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 22:24:47,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:47,834 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:47,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-03 22:24:48,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:24:48,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:48,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1397230291, now seen corresponding path program 1 times [2025-03-03 22:24:48,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:24:48,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247176104] [2025-03-03 22:24:48,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:48,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:24:48,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:24:48,038 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:24:48,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-03 22:24:48,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 22:24:48,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 22:24:48,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:48,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:48,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 22:24:48,113 INFO L279 TraceCheckSpWp]: Computing forward predicates...