./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-99.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 3f85399f13cd3660b524b9ee202c819bd1459b0c883e7c0e4ddb7463b5e0cc2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:27:49,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:27:49,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:27:49,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:27:49,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:27:49,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:27:49,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:27:49,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:27:49,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:27:49,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:27:49,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:27:49,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:27:49,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:27:49,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:27:49,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:27:49,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:27:49,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:27:49,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:27:49,376 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 -> 3f85399f13cd3660b524b9ee202c819bd1459b0c883e7c0e4ddb7463b5e0cc2f [2025-03-08 14:27:49,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:27:49,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:27:49,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:27:49,605 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:27:49,606 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:27:49,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-99.i [2025-03-08 14:27:51,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46e8618a/3144c8ff5fb64cf7b62b94940b120051/FLAG8e068988e [2025-03-08 14:27:51,684 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:27:51,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-99.i [2025-03-08 14:27:51,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46e8618a/3144c8ff5fb64cf7b62b94940b120051/FLAG8e068988e [2025-03-08 14:27:51,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46e8618a/3144c8ff5fb64cf7b62b94940b120051 [2025-03-08 14:27:51,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:27:51,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:27:51,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:27:51,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:27:51,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:27:51,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51, skipping insertion in model container [2025-03-08 14:27:51,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:27:51,834 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_25-1loop_file-99.i[915,928] [2025-03-08 14:27:51,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:27:51,879 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:27:51,887 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_25-1loop_file-99.i[915,928] [2025-03-08 14:27:51,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:27:51,907 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:27:51,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51 WrapperNode [2025-03-08 14:27:51,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:27:51,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:27:51,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:27:51,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:27:51,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,930 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-08 14:27:51,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:27:51,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:27:51,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:27:51,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:27:51,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,947 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:27:51,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:27:51,954 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:27:51,954 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:27:51,954 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:27:51,955 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (1/1) ... [2025-03-08 14:27:51,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:27:51,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:27:51,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:27:51,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:27:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:27:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:27:51,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:27:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:27:51,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:27:51,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:27:52,040 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:27:52,041 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:27:52,194 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 14:27:52,194 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:27:52,201 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:27:52,201 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:27:52,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:27:52 BoogieIcfgContainer [2025-03-08 14:27:52,201 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:27:52,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:27:52,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:27:52,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:27:52,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:27:51" (1/3) ... [2025-03-08 14:27:52,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353372ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:27:52, skipping insertion in model container [2025-03-08 14:27:52,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:51" (2/3) ... [2025-03-08 14:27:52,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353372ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:27:52, skipping insertion in model container [2025-03-08 14:27:52,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:27:52" (3/3) ... [2025-03-08 14:27:52,209 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-99.i [2025-03-08 14:27:52,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:27:52,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-99.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:27:52,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:27:52,268 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;@253423e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:27:52,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:27:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:27:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 14:27:52,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:27:52,279 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:27:52,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:27:52,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:27:52,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1866891103, now seen corresponding path program 1 times [2025-03-08 14:27:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:27:52,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488685275] [2025-03-08 14:27:52,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:52,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:27:52,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 14:27:52,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 14:27:52,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:52,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:27:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 14:27:52,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:27:52,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488685275] [2025-03-08 14:27:52,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488685275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:27:52,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934012272] [2025-03-08 14:27:52,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:52,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:27:52,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:27:52,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:27:52,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:27:52,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 14:27:52,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 14:27:52,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:52,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:27:52,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:27:52,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:27:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 14:27:52,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:27:52,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934012272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:27:52,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:27:52,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:27:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299535519] [2025-03-08 14:27:52,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:27:52,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:27:52,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:27:52,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:27:52,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:27:52,600 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:27:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:27:52,613 INFO L93 Difference]: Finished difference Result 75 states and 114 transitions. [2025-03-08 14:27:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:27:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2025-03-08 14:27:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:27:52,618 INFO L225 Difference]: With dead ends: 75 [2025-03-08 14:27:52,619 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 14:27:52,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:27:52,624 INFO L435 NwaCegarLoop]: 52 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, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:27:52,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:27:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 14:27:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 14:27:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:27:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-08 14:27:52,654 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 65 [2025-03-08 14:27:52,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:27:52,654 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-08 14:27:52,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:27:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-08 14:27:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 14:27:52,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:27:52,658 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:27:52,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:27:52,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:27:52,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:27:52,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:27:52,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1103209948, now seen corresponding path program 1 times [2025-03-08 14:27:52,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:27:52,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418223768] [2025-03-08 14:27:52,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:52,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:27:52,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 14:27:52,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 14:27:52,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:52,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:27:52,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:27:52,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 14:27:52,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 14:27:52,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:52,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:27:52,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:27:52,979 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:27:52,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:27:52,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:27:52,983 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:27:53,008 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:27:53,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:27:53 BoogieIcfgContainer [2025-03-08 14:27:53,010 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:27:53,011 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:27:53,011 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:27:53,011 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:27:53,012 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:27:52" (3/4) ... [2025-03-08 14:27:53,014 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:27:53,015 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:27:53,015 INFO L158 Benchmark]: Toolchain (without parser) took 1298.97ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 49.4MB in the end (delta: 71.7MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-08 14:27:53,016 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:27:53,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.36ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 108.5MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:27:53,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.42ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 106.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:27:53,017 INFO L158 Benchmark]: Boogie Preprocessor took 22.32ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 105.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:27:53,017 INFO L158 Benchmark]: IcfgBuilder took 247.61ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 91.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:27:53,018 INFO L158 Benchmark]: TraceAbstraction took 807.28ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 49.8MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 14:27:53,020 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 167.8MB. Free memory was 49.8MB in the beginning and 49.4MB in the end (delta: 410.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:27:53,021 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.36ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 108.5MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.42ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 106.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.32ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 105.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 247.61ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 91.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 807.28ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 49.8MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 167.8MB. Free memory was 49.8MB in the beginning and 49.4MB in the end (delta: 410.1kB). 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 43, overapproximation of someBinaryFLOATComparisonOperation at line 42, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someUnaryDOUBLEoperation at line 43, overapproximation of someUnaryDOUBLEoperation at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.5; [L23] unsigned char var_1_2 = 16; [L24] float var_1_4 = 1000000000000000.6; [L25] float var_1_5 = 500.5; [L26] float var_1_6 = 99999999999.5; [L27] double var_1_7 = 9.6; [L28] double var_1_8 = -0.2; [L29] double var_1_9 = 25.2; [L30] signed short int var_1_10 = 1; [L31] unsigned char var_1_11 = 0; [L32] signed long int var_1_15 = -64; VAL [isInitial=0, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=16, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L79] isInitial = 1 [L80] FCALL initially() [L81] int k_loop; [L82] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=16, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L82] COND TRUE k_loop < 1 [L83] FCALL updateLastVariables() [L84] CALL updateVariables() [L55] var_1_2 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L56] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L57] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L57] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L58] var_1_4 = __VERIFIER_nondet_float() [L59] 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, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L59] 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, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L60] var_1_5 = __VERIFIER_nondet_float() [L61] 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, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L61] 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, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L62] var_1_6 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L63] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L64] var_1_8 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L65] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L68] var_1_11 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L69] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L70] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L70] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L84] RET updateVariables() [L85] CALL step() [L36] signed long int stepLocal_0 = (((8) < 0 ) ? -(8) : (8)); VAL [isInitial=1, stepLocal_0=8, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L37] COND TRUE (((((200) < (128)) ? (200) : (128))) - var_1_2) > stepLocal_0 [L38] var_1_1 = (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) - var_1_6) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=48/5] [L42] COND TRUE var_1_5 >= (var_1_4 + var_1_6) [L43] var_1_7 = ((((var_1_8 + var_1_9) < 0 ) ? -(var_1_8 + var_1_9) : (var_1_8 + var_1_9))) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L45] COND FALSE !(((var_1_6 - var_1_4) + var_1_7) >= var_1_5) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L50] COND TRUE ((var_1_2 + var_1_15) + var_1_15) >= var_1_15 [L51] var_1_10 = var_1_2 VAL [isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L85] RET step() [L86] CALL, EXPR property() [L75-L76] return (((((((((200) < (128)) ? (200) : (128))) - var_1_2) > ((((8) < 0 ) ? -(8) : (8)))) ? (var_1_1 == ((float) (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) - var_1_6))) : (var_1_1 == ((float) var_1_6))) && ((var_1_5 >= (var_1_4 + var_1_6)) ? (var_1_7 == ((double) ((((var_1_8 + var_1_9) < 0 ) ? -(var_1_8 + var_1_9) : (var_1_8 + var_1_9))))) : 1)) && ((((var_1_2 + var_1_15) + var_1_15) >= var_1_15) ? (var_1_10 == ((signed short int) var_1_2)) : 1)) && ((((var_1_6 - var_1_4) + var_1_7) >= var_1_5) ? (var_1_11 ? (var_1_15 == ((signed long int) 100)) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L19] reach_error() VAL [isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 63 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 52 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 272/288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:27:53,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-99.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 3f85399f13cd3660b524b9ee202c819bd1459b0c883e7c0e4ddb7463b5e0cc2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:27:54,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:27:54,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:27:54,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:27:54,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:27:54,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:27:54,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:27:54,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:27:54,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:27:54,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:27:54,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:27:54,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:27:54,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:27:54,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:27:54,905 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:27:54,907 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:27:54,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:27:54,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:27:54,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:27:54,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:27:54,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:27:54,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:27:54,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:27:54,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:27:54,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:27:54,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:27:54,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:27:54,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:27:54,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:27:54,910 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:27:54,910 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:27:54,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:27:54,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:27:54,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:27:54,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:27:54,910 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 -> 3f85399f13cd3660b524b9ee202c819bd1459b0c883e7c0e4ddb7463b5e0cc2f [2025-03-08 14:27:55,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:27:55,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:27:55,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:27:55,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:27:55,158 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:27:55,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-99.i [2025-03-08 14:27:56,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d417707d/97859318e55a4537b769e3c91533fe3d/FLAG2be376284 [2025-03-08 14:27:56,447 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:27:56,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-99.i [2025-03-08 14:27:56,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d417707d/97859318e55a4537b769e3c91533fe3d/FLAG2be376284 [2025-03-08 14:27:56,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d417707d/97859318e55a4537b769e3c91533fe3d [2025-03-08 14:27:56,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:27:56,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:27:56,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:27:56,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:27:56,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:27:56,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61837157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56, skipping insertion in model container [2025-03-08 14:27:56,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:27:56,569 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_25-1loop_file-99.i[915,928] [2025-03-08 14:27:56,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:27:56,619 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:27:56,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-99.i[915,928] [2025-03-08 14:27:56,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:27:56,648 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:27:56,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56 WrapperNode [2025-03-08 14:27:56,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:27:56,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:27:56,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:27:56,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:27:56,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,682 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-08 14:27:56,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:27:56,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:27:56,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:27:56,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:27:56,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,716 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:27:56,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:27:56,739 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:27:56,739 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:27:56,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:27:56,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (1/1) ... [2025-03-08 14:27:56,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:27:56,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:27:56,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:27:56,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:27:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:27:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:27:56,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:27:56,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:27:56,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:27:56,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:27:56,873 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:27:56,875 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:28:04,266 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 14:28:04,266 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:28:04,289 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:28:04,289 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:28:04,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:04 BoogieIcfgContainer [2025-03-08 14:28:04,290 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:28:04,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:28:04,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:28:04,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:28:04,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:27:56" (1/3) ... [2025-03-08 14:28:04,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410c14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:28:04, skipping insertion in model container [2025-03-08 14:28:04,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:56" (2/3) ... [2025-03-08 14:28:04,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410c14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:28:04, skipping insertion in model container [2025-03-08 14:28:04,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:04" (3/3) ... [2025-03-08 14:28:04,296 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-99.i [2025-03-08 14:28:04,305 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:28:04,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-99.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:28:04,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:28:04,351 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;@c3887c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:28:04,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:28:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:28:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 14:28:04,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:04,359 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:28:04,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:04,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1866891103, now seen corresponding path program 1 times [2025-03-08 14:28:04,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:28:04,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448445538] [2025-03-08 14:28:04,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:04,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:28:04,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:28:04,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:28:04,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:28:04,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 14:28:04,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 14:28:04,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:04,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:04,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:28:04,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:28:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 14:28:04,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:28:04,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:28:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448445538] [2025-03-08 14:28:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448445538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:28:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:28:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:28:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022341132] [2025-03-08 14:28:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:28:04,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:28:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:28:04,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:28:04,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:28:04,695 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:28:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:28:04,708 INFO L93 Difference]: Finished difference Result 75 states and 114 transitions. [2025-03-08 14:28:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:28:04,709 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2025-03-08 14:28:04,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:28:04,713 INFO L225 Difference]: With dead ends: 75 [2025-03-08 14:28:04,713 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 14:28:04,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:28:04,719 INFO L435 NwaCegarLoop]: 52 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, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:28:04,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:28:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 14:28:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 14:28:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:28:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-08 14:28:04,751 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 65 [2025-03-08 14:28:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:28:04,752 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-08 14:28:04,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:28:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-08 14:28:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 14:28:04,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:04,754 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:28:04,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:28:04,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:28:04,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:04,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1103209948, now seen corresponding path program 1 times [2025-03-08 14:28:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:28:04,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923853002] [2025-03-08 14:28:04,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:04,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:28:04,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:28:04,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:28:04,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:28:04,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 14:28:05,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 14:28:05,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:05,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:05,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 14:28:05,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:29:15,996 WARN L286 SmtUtils]: Spent 19.52s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 14:29:24,097 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:29:32,246 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)