./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.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_loopvsstraightlinecode_50-1loop_file-2.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 84703b5fd2fbca77a636bf79712463c0e9901391b15edc6d772ff3f7bfe48b3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:28:47,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:28:47,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:28:47,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:28:47,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:28:47,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:28:47,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:28:47,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:28:47,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:28:47,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:28:47,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:28:47,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:28:47,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:28:47,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:28:47,657 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:28:47,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:28:47,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:28:47,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:28:47,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:28:47,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:28:47,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:28:47,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:28:47,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:28:47,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:28:47,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:28:47,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:28:47,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:28:47,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:28:47,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:28:47,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:28:47,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:28:47,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:28:47,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:28:47,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:28:47,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:28:47,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:28:47,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:28:47,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:28:47,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:28:47,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:28:47,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:28:47,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:28:47,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:28:47,660 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 -> 84703b5fd2fbca77a636bf79712463c0e9901391b15edc6d772ff3f7bfe48b3e [2025-03-03 23:28:47,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:28:47,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:28:47,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:28:47,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:28:47,879 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:28:47,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.i [2025-03-03 23:28:48,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f656e571/ef8f1c7727874ed8949dda1c9d94db29/FLAG05b62b388 [2025-03-03 23:28:49,194 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:28:49,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.i [2025-03-03 23:28:49,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f656e571/ef8f1c7727874ed8949dda1c9d94db29/FLAG05b62b388 [2025-03-03 23:28:49,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f656e571/ef8f1c7727874ed8949dda1c9d94db29 [2025-03-03 23:28:49,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:28:49,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:28:49,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:28:49,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:28:49,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:28:49,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fe0a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49, skipping insertion in model container [2025-03-03 23:28:49,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:28:49,665 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_loopvsstraightlinecode_50-1loop_file-2.i[914,927] [2025-03-03 23:28:49,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:28:49,710 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:28:49,720 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_loopvsstraightlinecode_50-1loop_file-2.i[914,927] [2025-03-03 23:28:49,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:28:49,761 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:28:49,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49 WrapperNode [2025-03-03 23:28:49,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:28:49,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:28:49,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:28:49,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:28:49,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,796 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-03 23:28:49,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:28:49,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:28:49,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:28:49,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:28:49,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,825 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 23:28:49,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:28:49,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:28:49,834 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:28:49,835 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:28:49,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (1/1) ... [2025-03-03 23:28:49,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:28:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:28:49,860 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 23:28:49,862 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 23:28:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:28:49,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:28:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:28:49,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:28:49,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:28:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:28:49,934 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:28:49,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:28:50,133 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:28:50,135 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:28:50,141 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:28:50,141 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:28:50,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:28:50 BoogieIcfgContainer [2025-03-03 23:28:50,142 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:28:50,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:28:50,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:28:50,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:28:50,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:28:49" (1/3) ... [2025-03-03 23:28:50,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef16512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:28:50, skipping insertion in model container [2025-03-03 23:28:50,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:49" (2/3) ... [2025-03-03 23:28:50,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef16512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:28:50, skipping insertion in model container [2025-03-03 23:28:50,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:28:50" (3/3) ... [2025-03-03 23:28:50,149 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-2.i [2025-03-03 23:28:50,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:28:50,161 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-2.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:28:50,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:28:50,222 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;@20bf7584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:28:50,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:28:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 23:28:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 23:28:50,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:28:50,234 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:28:50,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:28:50,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:28:50,238 INFO L85 PathProgramCache]: Analyzing trace with hash 980209268, now seen corresponding path program 1 times [2025-03-03 23:28:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:28:50,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141941602] [2025-03-03 23:28:50,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:28:50,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:28:50,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 23:28:50,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 23:28:50,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:28:50,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:28:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 23:28:50,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:28:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141941602] [2025-03-03 23:28:50,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141941602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:28:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457302500] [2025-03-03 23:28:50,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:28:50,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:28:50,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:28:50,411 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 23:28:50,413 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 23:28:50,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 23:28:50,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 23:28:50,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:28:50,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:28:50,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:28:50,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:28:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 23:28:50,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:28:50,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457302500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:28:50,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:28:50,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:28:50,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604586346] [2025-03-03 23:28:50,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:28:50,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:28:50,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:28:50,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:28:50,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:28:50,551 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 23:28:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:28:50,564 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2025-03-03 23:28:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:28:50,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2025-03-03 23:28:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:28:50,569 INFO L225 Difference]: With dead ends: 101 [2025-03-03 23:28:50,569 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 23:28:50,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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 23:28:50,574 INFO L435 NwaCegarLoop]: 72 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, 72 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 23:28:50,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:28:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 23:28:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 23:28:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 23:28:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-03 23:28:50,600 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 91 [2025-03-03 23:28:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:28:50,601 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-03 23:28:50,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 23:28:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-03-03 23:28:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 23:28:50,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:28:50,604 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:28:50,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:28:50,808 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 23:28:50,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:28:50,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:28:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash 134718673, now seen corresponding path program 1 times [2025-03-03 23:28:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:28:50,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822190209] [2025-03-03 23:28:50,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:28:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:28:50,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 23:28:50,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 23:28:50,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:28:50,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:28:50,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331741473] [2025-03-03 23:28:50,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:28:50,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:28:50,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:28:50,947 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 23:28:50,948 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 23:28:51,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 23:28:51,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 23:28:51,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:28:51,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:28:51,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 23:28:51,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:28:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 147 proven. 9 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-03 23:28:51,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:28:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-03 23:28:51,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:28:51,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822190209] [2025-03-03 23:28:51,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 23:28:51,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331741473] [2025-03-03 23:28:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331741473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:28:51,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:28:51,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 23:28:51,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479127781] [2025-03-03 23:28:51,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:28:51,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:28:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:28:51,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:28:51,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:28:51,679 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-03 23:28:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:28:51,988 INFO L93 Difference]: Finished difference Result 123 states and 170 transitions. [2025-03-03 23:28:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:28:51,989 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 92 [2025-03-03 23:28:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:28:51,990 INFO L225 Difference]: With dead ends: 123 [2025-03-03 23:28:51,991 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 23:28:51,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-03 23:28:51,992 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 241 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:28:51,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 160 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:28:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 23:28:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-03-03 23:28:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:28:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2025-03-03 23:28:52,010 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 92 [2025-03-03 23:28:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:28:52,011 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2025-03-03 23:28:52,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-03 23:28:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2025-03-03 23:28:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 23:28:52,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:28:52,015 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:28:52,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:28:52,215 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 23:28:52,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:28:52,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:28:52,216 INFO L85 PathProgramCache]: Analyzing trace with hash 553902033, now seen corresponding path program 1 times [2025-03-03 23:28:52,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:28:52,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99430832] [2025-03-03 23:28:52,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:28:52,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:28:52,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 23:28:52,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 23:28:52,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:28:52,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:28:52,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646255527] [2025-03-03 23:28:52,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:28:52,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:28:52,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:28:52,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:28:52,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:28:52,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 23:28:52,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 23:28:52,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:28:52,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:28:52,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:28:52,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 23:28:52,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 23:28:52,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:28:52,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:28:52,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:28:52,486 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:28:52,487 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:28:52,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 23:28:52,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:28:52,691 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 23:28:52,744 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:28:52,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:28:52 BoogieIcfgContainer [2025-03-03 23:28:52,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:28:52,747 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:28:52,747 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:28:52,747 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:28:52,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:28:50" (3/4) ... [2025-03-03 23:28:52,749 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:28:52,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:28:52,750 INFO L158 Benchmark]: Toolchain (without parser) took 3202.64ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 66.8MB in the end (delta: 38.9MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2025-03-03 23:28:52,750 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:28:52,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.54ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 91.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:28:52,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.64ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:28:52,750 INFO L158 Benchmark]: Boogie Preprocessor took 36.90ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:28:52,751 INFO L158 Benchmark]: IcfgBuilder took 307.59ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 71.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:28:52,751 INFO L158 Benchmark]: TraceAbstraction took 2602.19ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 67.8MB in the end (delta: 3.2MB). Peak memory consumption was 909.0kB. Max. memory is 16.1GB. [2025-03-03 23:28:52,751 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 66.8MB in the end (delta: 921.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:28:52,755 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.22ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.54ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 91.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.64ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.90ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.59ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 71.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2602.19ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 67.8MB in the end (delta: 3.2MB). Peak memory consumption was 909.0kB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 66.8MB in the end (delta: 921.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 someBinaryArithmeticDOUBLEoperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryArithmeticFLOAToperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] unsigned long int last_1_var_1_6 = 10000; VAL [isInitial=0, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L121] isInitial = 1 [L122] FCALL initially() [L123] int k_loop; [L124] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L124] COND TRUE k_loop < 1 [L125] CALL updateLastVariables() [L114] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L90] var_1_4 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L91] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L92] var_1_5 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L93] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L94] var_1_8 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L95] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L96] var_1_11 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L97] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L98] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L98] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L99] var_1_12 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L100] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L101] var_1_13 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L102] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L103] var_1_15 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L104] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L105] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L105] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L106] var_1_16 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L108] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L108] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L109] var_1_18 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L110] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L111] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L111] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L126] RET updateVariables() [L127] CALL step() [L43] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L44] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L46] COND TRUE (var_1_5 / var_1_11) >= (var_1_8 - var_1_4) [L47] var_1_10 = (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=0, var_1_6=10000] [L51] var_1_20 = var_1_16 [L52] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=10000] [L53] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=10000] [L54] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L55] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=10000] [L62] unsigned char stepLocal_0 = var_1_20 != var_1_20; VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=10000] [L63] COND FALSE !(\read(var_1_17)) [L74] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=1] [L76] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=1] [L77] COND FALSE !(var_1_6 > var_1_6) [L80] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=4, var_1_20=1, var_1_21=1, var_1_4=0, var_1_5=4, var_1_6=1] [L85] COND TRUE var_1_1 < var_1_11 [L86] var_1_19 = (var_1_13 - 256.4) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=1, var_1_21=1, var_1_4=0, var_1_5=4, var_1_6=1] [L127] RET step() [L128] CALL, EXPR property() [L117-L118] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; VAL [\result=0, isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=1, var_1_21=1, var_1_4=0, var_1_5=4, var_1_6=1] [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=1, var_1_21=1, var_1_4=0, var_1_5=4, var_1_6=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=1, var_1_21=1, var_1_4=0, var_1_5=4, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 138 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 683 SizeOfPredicates, 3 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1206/1248 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 23:28:52,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.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 84703b5fd2fbca77a636bf79712463c0e9901391b15edc6d772ff3f7bfe48b3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:28:54,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:28:54,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:28:54,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:28:54,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:28:54,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:28:54,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:28:54,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:28:54,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:28:54,659 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:28:54,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:28:54,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:28:54,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:28:54,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:28:54,659 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:28:54,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:28:54,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:28:54,660 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:28:54,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:28:54,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:28:54,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:28:54,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:28:54,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:28:54,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:28:54,661 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 -> 84703b5fd2fbca77a636bf79712463c0e9901391b15edc6d772ff3f7bfe48b3e [2025-03-03 23:28:54,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:28:54,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:28:54,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:28:54,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:28:54,897 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:28:54,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.i [2025-03-03 23:28:56,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe968c27/5ea0e31bb36c47c58063c85c352bf37a/FLAGe886c13a8 [2025-03-03 23:28:56,267 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:28:56,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-2.i [2025-03-03 23:28:56,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe968c27/5ea0e31bb36c47c58063c85c352bf37a/FLAGe886c13a8 [2025-03-03 23:28:56,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe968c27/5ea0e31bb36c47c58063c85c352bf37a [2025-03-03 23:28:56,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:28:56,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:28:56,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:28:56,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:28:56,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:28:56,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c29e12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56, skipping insertion in model container [2025-03-03 23:28:56,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:28:56,432 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_loopvsstraightlinecode_50-1loop_file-2.i[914,927] [2025-03-03 23:28:56,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:28:56,492 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:28:56,502 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_loopvsstraightlinecode_50-1loop_file-2.i[914,927] [2025-03-03 23:28:56,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:28:56,547 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:28:56,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56 WrapperNode [2025-03-03 23:28:56,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:28:56,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:28:56,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:28:56,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:28:56,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,592 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-03 23:28:56,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:28:56,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:28:56,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:28:56,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:28:56,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,619 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 23:28:56,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,635 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:28:56,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:28:56,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:28:56,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:28:56,649 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (1/1) ... [2025-03-03 23:28:56,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:28:56,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:28:56,679 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 23:28:56,682 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 23:28:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:28:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:28:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:28:56,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:28:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:28:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:28:56,754 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:28:56,755 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:29:12,544 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:29:12,544 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:29:12,550 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:29:12,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:29:12,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:29:12 BoogieIcfgContainer [2025-03-03 23:29:12,551 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:29:12,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:29:12,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:29:12,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:29:12,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:28:56" (1/3) ... [2025-03-03 23:29:12,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a40864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:29:12, skipping insertion in model container [2025-03-03 23:29:12,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:28:56" (2/3) ... [2025-03-03 23:29:12,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a40864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:29:12, skipping insertion in model container [2025-03-03 23:29:12,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:29:12" (3/3) ... [2025-03-03 23:29:12,558 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-2.i [2025-03-03 23:29:12,567 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:29:12,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-2.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:29:12,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:29:12,619 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;@227edfe1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:29:12,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:29:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 23:29:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 23:29:12,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:29:12,627 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:29:12,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:29:12,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:29:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash 980209268, now seen corresponding path program 1 times [2025-03-03 23:29:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:29:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712902261] [2025-03-03 23:29:12,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:12,638 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 23:29:12,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:29:12,640 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 23:29:12,641 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 23:29:12,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 23:29:13,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 23:29:13,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:13,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:29:13,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:29:13,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:29:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 23:29:13,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:29:13,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:29:13,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712902261] [2025-03-03 23:29:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712902261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:29:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:29:13,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:29:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812868903] [2025-03-03 23:29:13,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:29:13,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:29:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:29:13,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:29:13,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:29:13,239 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 23:29:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:29:13,252 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2025-03-03 23:29:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:29:13,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-03 23:29:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:29:13,256 INFO L225 Difference]: With dead ends: 101 [2025-03-03 23:29:13,257 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 23:29:13,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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 23:29:13,260 INFO L435 NwaCegarLoop]: 72 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, 72 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 23:29:13,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:29:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 23:29:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 23:29:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 23:29:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-03 23:29:13,288 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 91 [2025-03-03 23:29:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:29:13,289 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-03 23:29:13,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 23:29:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-03-03 23:29:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 23:29:13,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:29:13,293 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:29:13,311 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 23:29:13,494 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 23:29:13,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:29:13,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:29:13,495 INFO L85 PathProgramCache]: Analyzing trace with hash 134718673, now seen corresponding path program 1 times [2025-03-03 23:29:13,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:29:13,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791386984] [2025-03-03 23:29:13,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:13,496 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 23:29:13,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:29:13,497 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 23:29:13,498 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 23:29:13,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 23:29:13,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 23:29:13,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:13,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:29:13,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:29:13,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:29:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-03 23:29:14,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:29:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-03 23:29:15,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:29:15,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791386984] [2025-03-03 23:29:15,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791386984] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:29:15,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:29:15,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-03 23:29:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154432377] [2025-03-03 23:29:15,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:29:15,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:29:15,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:29:15,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:29:15,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:29:15,757 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:29:22,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:29:26,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:29:30,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:29:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:29:31,035 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions. [2025-03-03 23:29:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:29:31,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 92 [2025-03-03 23:29:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:29:31,037 INFO L225 Difference]: With dead ends: 125 [2025-03-03 23:29:31,038 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 23:29:31,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:29:31,039 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 94 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:29:31,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 178 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 207 Invalid, 3 Unknown, 0 Unchecked, 14.8s Time] [2025-03-03 23:29:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 23:29:31,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2025-03-03 23:29:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:29:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2025-03-03 23:29:31,050 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 92 [2025-03-03 23:29:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:29:31,050 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2025-03-03 23:29:31,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:29:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2025-03-03 23:29:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 23:29:31,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:29:31,052 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:29:31,070 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 23:29:31,252 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 23:29:31,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:29:31,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:29:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash 553902033, now seen corresponding path program 1 times [2025-03-03 23:29:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:29:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761364466] [2025-03-03 23:29:31,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:29:31,253 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 23:29:31,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:29:31,256 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 23:29:31,257 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 23:29:31,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 23:29:31,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 23:29:31,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:29:31,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:29:31,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 23:29:31,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:29:54,139 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 23:30:02,279 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 23:30:10,427 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 23:30:18,567 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 23:30:26,715 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 23:30:34,862 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)