./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 84b9b484a0a851d8bdc3d133b59eb42adec2817266fa068895794fd4caa48d14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:27:59,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:27:59,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:27:59,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:27:59,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:27:59,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:27:59,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:27:59,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:27:59,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:27:59,795 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:27:59,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:27:59,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:27:59,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:27:59,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:27:59,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:27:59,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:27:59,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:27:59,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:27:59,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:27:59,797 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-jdk21/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 -> 84b9b484a0a851d8bdc3d133b59eb42adec2817266fa068895794fd4caa48d14 [2025-01-09 13:28:00,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:28:00,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:28:00,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:28:00,052 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:28:00,053 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:28:00,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i [2025-01-09 13:28:01,338 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fefc78c11/1461665f06774e80aaf22eaab516c8f0/FLAGb47b0c4e9 [2025-01-09 13:28:01,622 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:28:01,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i [2025-01-09 13:28:01,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fefc78c11/1461665f06774e80aaf22eaab516c8f0/FLAGb47b0c4e9 [2025-01-09 13:28:01,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fefc78c11/1461665f06774e80aaf22eaab516c8f0 [2025-01-09 13:28:01,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:28:01,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:28:01,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:28:01,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:28:01,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:28:01,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416ab55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01, skipping insertion in model container [2025-01-09 13:28:01,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:28:01,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i[915,928] [2025-01-09 13:28:01,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:28:01,843 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:28:01,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i[915,928] [2025-01-09 13:28:01,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:28:01,888 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:28:01,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01 WrapperNode [2025-01-09 13:28:01,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:28:01,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:28:01,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:28:01,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:28:01,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,935 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2025-01-09 13:28:01,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:28:01,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:28:01,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:28:01,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:28:01,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,965 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-01-09 13:28:01,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:28:01,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:28:01,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:28:01,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:28:01,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (1/1) ... [2025-01-09 13:28:01,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:02,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:28:02,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:28:02,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:28:02,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:28:02,042 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:28:02,043 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:28:02,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:28:02,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:28:02,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:28:02,099 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:28:02,101 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:28:02,241 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 13:28:02,242 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:28:02,248 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:28:02,248 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:28:02,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:28:02 BoogieIcfgContainer [2025-01-09 13:28:02,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:28:02,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:28:02,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:28:02,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:28:02,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:28:01" (1/3) ... [2025-01-09 13:28:02,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c8e6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:28:02, skipping insertion in model container [2025-01-09 13:28:02,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:01" (2/3) ... [2025-01-09 13:28:02,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c8e6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:28:02, skipping insertion in model container [2025-01-09 13:28:02,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:28:02" (3/3) ... [2025-01-09 13:28:02,260 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-29.i [2025-01-09 13:28:02,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:28:02,273 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-29.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:28:02,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:28:02,330 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;@2dabd162, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:28:02,330 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:28:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:28:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:28:02,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:02,340 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:28:02,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:02,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 51414978, now seen corresponding path program 1 times [2025-01-09 13:28:02,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:28:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352635791] [2025-01-09 13:28:02,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:28:02,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:28:02,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:28:02,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:02,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:28:02,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:28:02,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352635791] [2025-01-09 13:28:02,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352635791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:28:02,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491822398] [2025-01-09 13:28:02,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:02,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:28:02,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:28:02,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:28:02,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:28:02,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:28:02,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:28:02,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:02,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:02,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:28:02,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:28:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:28:02,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:28:02,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491822398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:28:02,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:28:02,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:28:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534212283] [2025-01-09 13:28:02,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:28:02,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:28:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:28:02,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:28:02,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:28:02,674 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 13:28:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:28:02,694 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2025-01-09 13:28:02,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:28:02,696 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-01-09 13:28:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:28:02,700 INFO L225 Difference]: With dead ends: 76 [2025-01-09 13:28:02,701 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 13:28:02,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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-01-09 13:28:02,706 INFO L435 NwaCegarLoop]: 53 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, 53 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-01-09 13:28:02,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:28:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 13:28:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-09 13:28:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:28:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2025-01-09 13:28:02,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 69 [2025-01-09 13:28:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:28:02,734 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2025-01-09 13:28:02,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 13:28:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2025-01-09 13:28:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:28:02,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:02,736 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:28:02,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:28:02,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:28:02,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:02,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:02,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1711994950, now seen corresponding path program 1 times [2025-01-09 13:28:02,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:28:02,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348660426] [2025-01-09 13:28:02,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:28:02,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:28:03,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:28:03,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:03,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:28:03,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:28:03,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:28:03,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:28:03,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:03,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:28:03,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:28:03,072 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:28:03,073 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:28:03,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:28:03,078 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 13:28:03,131 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:28:03,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:28:03 BoogieIcfgContainer [2025-01-09 13:28:03,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:28:03,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:28:03,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:28:03,135 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:28:03,136 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:28:02" (3/4) ... [2025-01-09 13:28:03,137 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:28:03,139 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:28:03,140 INFO L158 Benchmark]: Toolchain (without parser) took 1478.48ms. Allocated memory is still 201.3MB. Free memory was 159.8MB in the beginning and 84.0MB in the end (delta: 75.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 13:28:03,140 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 218.1MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:28:03,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.29ms. Allocated memory is still 201.3MB. Free memory was 159.4MB in the beginning and 147.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:28:03,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.89ms. Allocated memory is still 201.3MB. Free memory was 147.3MB in the beginning and 145.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:28:03,141 INFO L158 Benchmark]: Boogie Preprocessor took 46.30ms. Allocated memory is still 201.3MB. Free memory was 145.3MB in the beginning and 142.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:28:03,141 INFO L158 Benchmark]: RCFGBuilder took 258.06ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 128.4MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:28:03,142 INFO L158 Benchmark]: TraceAbstraction took 883.44ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 84.0MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 13:28:03,142 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 201.3MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:28:03,145 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.28ms. Allocated memory is still 218.1MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.29ms. Allocated memory is still 201.3MB. Free memory was 159.4MB in the beginning and 147.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.89ms. Allocated memory is still 201.3MB. Free memory was 147.3MB in the beginning and 145.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.30ms. Allocated memory is still 201.3MB. Free memory was 145.3MB in the beginning and 142.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 258.06ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 128.4MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 883.44ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 84.0MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 201.3MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 2.5; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 9.3; [L25] float var_1_4 = 3.4; [L26] unsigned short int var_1_5 = 32; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 64; [L29] unsigned short int var_1_8 = 16; [L30] unsigned short int var_1_9 = 1; VAL [isInitial=0, var_1_1=5/2, var_1_2=0, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L80] isInitial = 1 [L81] FCALL initially() [L83] FCALL updateLastVariables() [L84] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L58] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L58] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L59] var_1_3 = __VERIFIER_nondet_float() [L60] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L60] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L61] var_1_4 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L62] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L63] var_1_6 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_7=64, var_1_8=16, var_1_9=1] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_7=64, var_1_8=16, var_1_9=1] [L65] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=64, var_1_8=16, var_1_9=1] [L65] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=64, var_1_8=16, var_1_9=1] [L66] var_1_7 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_8=16, var_1_9=1] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_8=16, var_1_9=1] [L68] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=32767, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=32767, var_1_8=16, var_1_9=1] [L68] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=32767, var_1_8=16, var_1_9=1] [L69] var_1_8 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=32767, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=32767, var_1_9=1] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=32767, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=32767, var_1_8=6553, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=32767, var_1_8=6553, var_1_9=1] [L71] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=32766, var_1_7=32767, var_1_8=6553, var_1_9=1] [L84] RET updateVariables() [L85] CALL step() [L34] COND TRUE \read(var_1_2) [L35] var_1_1 = var_1_3 VAL [isInitial=1, var_1_1=65538, var_1_2=1, var_1_3=65538, var_1_5=32, var_1_6=32766, var_1_7=32767, var_1_8=6553, var_1_9=1] [L41] COND TRUE (var_1_1 + 8.125) > (var_1_1 * var_1_3) [L42] var_1_5 = (((((var_1_6 + var_1_7)) > (var_1_8)) ? ((var_1_6 + var_1_7)) : (var_1_8))) VAL [isInitial=1, var_1_1=65538, var_1_2=1, var_1_3=65538, var_1_5=65533, var_1_6=32766, var_1_7=32767, var_1_8=6553, var_1_9=1] [L46] signed long int stepLocal_0 = 5 * var_1_8; VAL [isInitial=1, stepLocal_0=32765, var_1_1=65538, var_1_2=1, var_1_3=65538, var_1_5=65533, var_1_6=32766, var_1_7=32767, var_1_8=6553, var_1_9=1] [L47] COND FALSE !(((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) VAL [isInitial=1, stepLocal_0=32765, var_1_1=65538, var_1_2=1, var_1_3=65538, var_1_5=65533, var_1_6=32766, var_1_7=32767, var_1_8=6553, var_1_9=1] [L85] RET step() [L86] CALL, EXPR property() [L76-L77] return ((var_1_2 ? (var_1_1 == ((float) var_1_3)) : ((! (var_1_3 < var_1_4)) ? (var_1_1 == ((float) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1)) && (((var_1_1 + 8.125) > (var_1_1 * var_1_3)) ? (var_1_5 == ((unsigned short int) (((((var_1_6 + var_1_7)) > (var_1_8)) ? ((var_1_6 + var_1_7)) : (var_1_8))))) : (var_1_5 == ((unsigned short int) var_1_8)))) && ((((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) ? ((var_1_6 > (5 * var_1_8)) ? ((var_1_1 < (var_1_1 * 256.5f)) ? (var_1_9 == ((unsigned short int) var_1_6)) : 1) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_1=65538, var_1_2=1, var_1_3=65538, var_1_5=65533, var_1_6=32766, var_1_7=32767, var_1_8=6553, var_1_9=1] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=65538, var_1_2=1, var_1_3=65538, var_1_5=65533, var_1_6=32766, var_1_7=32767, var_1_8=6553, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_1=65538, var_1_2=1, var_1_3=65538, var_1_5=65533, var_1_6=32766, var_1_7=32767, var_1_8=6553, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 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, 53 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 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-01-09 13:28:03,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 84b9b484a0a851d8bdc3d133b59eb42adec2817266fa068895794fd4caa48d14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:28:05,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:28:05,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:28:05,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:28:05,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:28:05,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:28:05,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:28:05,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:28:05,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:28:05,354 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:28:05,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:28:05,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:28:05,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:28:05,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:28:05,354 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:28:05,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:28:05,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:28:05,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:28:05,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:28:05,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:28:05,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:05,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:28:05,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:28:05,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:28:05,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:28:05,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:05,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:28:05,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:28:05,359 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:28:05,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:28:05,359 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:28:05,360 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:28:05,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:28:05,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:28:05,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:28:05,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:28:05,360 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-jdk21/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 -> 84b9b484a0a851d8bdc3d133b59eb42adec2817266fa068895794fd4caa48d14 [2025-01-09 13:28:05,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:28:05,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:28:05,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:28:05,634 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:28:05,634 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:28:05,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i [2025-01-09 13:28:07,029 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5dd182cdb/c4f2877789774faea3ebb7c64e84b104/FLAG429e663ce [2025-01-09 13:28:07,208 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:28:07,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i [2025-01-09 13:28:07,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5dd182cdb/c4f2877789774faea3ebb7c64e84b104/FLAG429e663ce [2025-01-09 13:28:07,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5dd182cdb/c4f2877789774faea3ebb7c64e84b104 [2025-01-09 13:28:07,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:28:07,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:28:07,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:28:07,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:28:07,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:28:07,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe21eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07, skipping insertion in model container [2025-01-09 13:28:07,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:28:07,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i[915,928] [2025-01-09 13:28:07,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:28:07,784 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:28:07,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i[915,928] [2025-01-09 13:28:07,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:28:07,818 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:28:07,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07 WrapperNode [2025-01-09 13:28:07,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:28:07,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:28:07,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:28:07,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:28:07,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,844 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2025-01-09 13:28:07,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:28:07,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:28:07,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:28:07,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:28:07,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,868 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-01-09 13:28:07,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,877 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:28:07,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:28:07,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:28:07,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:28:07,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (1/1) ... [2025-01-09 13:28:07,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:07,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:28:07,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:28:07,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:28:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:28:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:28:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:28:07,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:28:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:28:07,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:28:08,031 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:28:08,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:28:17,348 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 13:28:17,348 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:28:17,356 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:28:17,356 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:28:17,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:28:17 BoogieIcfgContainer [2025-01-09 13:28:17,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:28:17,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:28:17,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:28:17,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:28:17,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:28:07" (1/3) ... [2025-01-09 13:28:17,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21898cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:28:17, skipping insertion in model container [2025-01-09 13:28:17,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:07" (2/3) ... [2025-01-09 13:28:17,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21898cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:28:17, skipping insertion in model container [2025-01-09 13:28:17,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:28:17" (3/3) ... [2025-01-09 13:28:17,364 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-29.i [2025-01-09 13:28:17,375 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:28:17,376 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-29.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:28:17,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:28:17,430 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;@5892f197, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:28:17,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:28:17,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:28:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:28:17,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:17,443 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:28:17,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:17,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash 51414978, now seen corresponding path program 1 times [2025-01-09 13:28:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:28:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942511938] [2025-01-09 13:28:17,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:17,458 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-01-09 13:28:17,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:28:17,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 13:28:17,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:28:17,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:28:17,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:28:17,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:17,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:17,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:28:17,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:28:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:28:17,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:28:17,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:28:17,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942511938] [2025-01-09 13:28:17,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942511938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:28:17,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:28:17,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:28:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876943791] [2025-01-09 13:28:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:28:17,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:28:17,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:28:17,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:28:17,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:28:17,793 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:28:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:28:17,806 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2025-01-09 13:28:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:28:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-01-09 13:28:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:28:17,812 INFO L225 Difference]: With dead ends: 76 [2025-01-09 13:28:17,812 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 13:28:17,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-01-09 13:28:17,816 INFO L435 NwaCegarLoop]: 53 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, 53 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-01-09 13:28:17,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:28:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 13:28:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-09 13:28:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:28:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2025-01-09 13:28:17,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 69 [2025-01-09 13:28:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:28:17,854 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2025-01-09 13:28:17,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:28:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2025-01-09 13:28:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:28:17,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:17,860 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:28:17,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:28:18,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 13:28:18,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:18,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:18,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1711994950, now seen corresponding path program 1 times [2025-01-09 13:28:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:28:18,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117798122] [2025-01-09 13:28:18,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:18,063 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-01-09 13:28:18,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:28:18,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 13:28:18,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:28:18,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:28:18,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:28:18,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:18,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:18,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:28:18,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:28:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 84 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 13:28:19,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:28:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 13:28:20,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:28:20,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117798122] [2025-01-09 13:28:20,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117798122] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:28:20,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:28:20,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-09 13:28:20,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351689460] [2025-01-09 13:28:20,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:28:20,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:28:20,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:28:20,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:28:20,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:28:20,120 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 13:28:22,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:28:24,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:28:27,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:28:29,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:28:32,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:28:35,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:28:39,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:28:43,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:28:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:28:43,441 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2025-01-09 13:28:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 13:28:43,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 69 [2025-01-09 13:28:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:28:43,443 INFO L225 Difference]: With dead ends: 118 [2025-01-09 13:28:43,443 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 13:28:43,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=321, Unknown=0, NotChecked=0, Total=506 [2025-01-09 13:28:43,444 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 162 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:28:43,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 128 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 22.7s Time] [2025-01-09 13:28:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 13:28:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2025-01-09 13:28:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:28:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2025-01-09 13:28:43,452 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 69 [2025-01-09 13:28:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:28:43,453 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-01-09 13:28:43,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 13:28:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2025-01-09 13:28:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 13:28:43,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:43,454 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:28:43,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:28:43,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 13:28:43,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:43,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash 601714357, now seen corresponding path program 1 times [2025-01-09 13:28:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:28:43,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653364073] [2025-01-09 13:28:43,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:43,659 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-01-09 13:28:43,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:28:43,662 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 13:28:43,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:28:43,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 13:28:43,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 13:28:43,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:43,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:43,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 13:28:43,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:29:38,924 WARN L286 SmtUtils]: Spent 19.37s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)