./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-80.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-1loop_file-80.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 2f49db024cf89bfd4f79528ea90efdc9ebcf8b7a9e599658c336eeffe7b60010 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:22:58,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:22:58,165 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:22:58,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:22:58,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:22:58,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:22:58,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:22:58,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:22:58,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:22:58,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:22:58,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:22:58,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:22:58,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:22:58,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:22:58,209 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:22:58,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:22:58,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:22:58,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:22:58,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:22:58,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:22:58,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:22:58,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:22:58,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:22:58,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:22:58,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:22:58,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:22:58,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:22:58,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:22:58,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:22:58,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:22:58,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:22:58,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:22:58,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:22:58,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:22:58,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:22:58,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:22:58,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:22:58,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:22:58,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:22:58,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:22:58,212 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:22:58,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:22:58,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:22:58,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:22:58,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:22:58,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:22:58,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:22:58,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:22:58,213 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 -> 2f49db024cf89bfd4f79528ea90efdc9ebcf8b7a9e599658c336eeffe7b60010 [2025-01-09 13:22:58,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:22:58,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:22:58,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:22:58,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:22:58,508 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:22:58,510 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-1loop_file-80.i [2025-01-09 13:22:59,855 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/008c5049e/1b9583f0618a47ae93b88a360e54dedc/FLAGefe01c753 [2025-01-09 13:23:00,129 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:23:00,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-80.i [2025-01-09 13:23:00,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/008c5049e/1b9583f0618a47ae93b88a360e54dedc/FLAGefe01c753 [2025-01-09 13:23:00,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/008c5049e/1b9583f0618a47ae93b88a360e54dedc [2025-01-09 13:23:00,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:23:00,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:23:00,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:23:00,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:23:00,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:23:00,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a328d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00, skipping insertion in model container [2025-01-09 13:23:00,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:23:00,586 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-1loop_file-80.i[915,928] [2025-01-09 13:23:00,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:23:00,651 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:23:00,663 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-1loop_file-80.i[915,928] [2025-01-09 13:23:00,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:23:00,706 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:23:00,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00 WrapperNode [2025-01-09 13:23:00,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:23:00,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:23:00,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:23:00,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:23:00,717 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:23:00" (1/1) ... [2025-01-09 13:23:00,726 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:23:00" (1/1) ... [2025-01-09 13:23:00,755 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-01-09 13:23:00,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:23:00,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:23:00,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:23:00,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:23:00,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,785 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:23:00,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:23:00,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:23:00,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:23:00,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:23:00,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (1/1) ... [2025-01-09 13:23:00,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:23:00,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:23:00,839 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:23:00,841 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:23:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:23:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:23:00,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:23:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:23:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:23:00,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:23:00,929 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:23:00,931 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:23:01,115 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 13:23:01,115 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:23:01,128 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:23:01,130 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:23:01,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:01 BoogieIcfgContainer [2025-01-09 13:23:01,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:23:01,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:23:01,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:23:01,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:23:01,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:23:00" (1/3) ... [2025-01-09 13:23:01,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd9919f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:23:01, skipping insertion in model container [2025-01-09 13:23:01,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:00" (2/3) ... [2025-01-09 13:23:01,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd9919f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:23:01, skipping insertion in model container [2025-01-09 13:23:01,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:01" (3/3) ... [2025-01-09 13:23:01,140 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-80.i [2025-01-09 13:23:01,152 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:23:01,154 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-80.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:23:01,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:23:01,211 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;@2904f405, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:23:01,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:23:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:23:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 13:23:01,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:01,227 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:01,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:01,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash -947954708, now seen corresponding path program 1 times [2025-01-09 13:23:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:23:01,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68026025] [2025-01-09 13:23:01,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:23:01,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:23:01,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:23:01,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:01,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 13:23:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:23:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68026025] [2025-01-09 13:23:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68026025] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:23:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003076998] [2025-01-09 13:23:01,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:01,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:23:01,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:23:01,522 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:23:01,523 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:23:01,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:23:01,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:23:01,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:01,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:01,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:23:01,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:23:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 13:23:01,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:23:01,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003076998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:23:01,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:23:01,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:23:01,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904879573] [2025-01-09 13:23:01,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:23:01,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:23:01,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:23:01,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:23:01,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:23:01,763 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 13:23:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:23:01,794 INFO L93 Difference]: Finished difference Result 115 states and 195 transitions. [2025-01-09 13:23:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:23:01,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2025-01-09 13:23:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:23:01,820 INFO L225 Difference]: With dead ends: 115 [2025-01-09 13:23:01,820 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 13:23:01,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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:23:01,825 INFO L435 NwaCegarLoop]: 86 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, 86 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:23:01,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:23:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 13:23:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 13:23:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:23:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-01-09 13:23:01,859 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 135 [2025-01-09 13:23:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:23:01,859 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-01-09 13:23:01,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 13:23:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-01-09 13:23:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 13:23:01,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:01,864 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:01,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:23:02,064 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:23:02,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:02,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1283145832, now seen corresponding path program 1 times [2025-01-09 13:23:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:23:02,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854259278] [2025-01-09 13:23:02,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:02,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:23:02,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:23:02,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:23:02,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:02,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:23:02,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564336615] [2025-01-09 13:23:02,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:23:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:23:02,248 INFO L229 MonitoredProcess]: Starting monitored process 3 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:23:02,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:23:02,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:23:02,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:23:02,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:02,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:23:02,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:23:02,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:23:02,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:23:02,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:02,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:23:02,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:23:02,460 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:23:02,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:23:02,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:23:02,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:23:02,667 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 13:23:02,762 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:23:02,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:23:02 BoogieIcfgContainer [2025-01-09 13:23:02,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:23:02,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:23:02,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:23:02,768 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:23:02,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:01" (3/4) ... [2025-01-09 13:23:02,771 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:23:02,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:23:02,773 INFO L158 Benchmark]: Toolchain (without parser) took 2350.09ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 63.9MB in the end (delta: 41.0MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2025-01-09 13:23:02,773 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:23:02,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.53ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 92.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:23:02,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.42ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:23:02,776 INFO L158 Benchmark]: Boogie Preprocessor took 45.67ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:23:02,776 INFO L158 Benchmark]: RCFGBuilder took 321.67ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 72.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:23:02,776 INFO L158 Benchmark]: TraceAbstraction took 1634.79ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 64.7MB in the end (delta: 7.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2025-01-09 13:23:02,777 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 142.6MB. Free memory was 64.7MB in the beginning and 63.9MB in the end (delta: 796.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:23:02,779 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.37ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.53ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 92.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.42ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.67ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 321.67ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 72.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1634.79ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 64.7MB in the end (delta: 7.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 142.6MB. Free memory was 64.7MB in the beginning and 63.9MB in the end (delta: 796.0kB). 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 91, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 256; [L23] signed long int var_1_2 = -128; [L24] signed long int var_1_3 = 8; [L25] signed long int var_1_4 = 0; [L26] signed long int var_1_5 = 8; [L27] signed long int var_1_6 = 10; [L28] signed long int var_1_7 = 5; [L29] signed long int var_1_8 = 128; [L30] signed short int var_1_9 = 128; [L31] float var_1_10 = 64.4; [L32] float var_1_11 = 10.25; [L33] double var_1_12 = 63.175; [L34] unsigned char var_1_13 = 1; [L35] double var_1_14 = 128.5; [L36] double var_1_15 = 128.8; VAL [isInitial=0, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=-128, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L107] isInitial = 1 [L108] FCALL initially() [L109] int k_loop; [L110] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=-128, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L110] COND TRUE k_loop < 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L66] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L67] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L67] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L68] var_1_3 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_3 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L69] RET assume_abort_if_not(var_1_3 >= -1) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L70] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L70] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L71] var_1_4 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L73] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L73] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L74] var_1_5 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L75] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L76] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L76] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L77] var_1_6 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L79] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L79] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L80] var_1_7 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=128, var_1_9=128] [L81] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=128, var_1_9=128] [L82] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=128, var_1_9=128] [L82] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=128, var_1_9=128] [L83] var_1_8 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=128] [L84] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=128] [L85] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=128] [L85] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=128] [L86] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=128] [L86] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=128] [L87] var_1_9 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_9 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L88] RET assume_abort_if_not(var_1_9 >= -32767) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L89] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L89] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L90] var_1_11 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L91] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L92] var_1_13 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L93] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L94] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L94] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L95] var_1_14 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L96] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L97] var_1_15 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L98] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L112] RET updateVariables() [L113] CALL step() [L40] COND TRUE (((((var_1_3 - var_1_4)) > (var_1_2)) ? ((var_1_3 - var_1_4)) : (var_1_2))) <= (((((var_1_5 - var_1_6)) < ((var_1_7 % var_1_8))) ? ((var_1_5 - var_1_6)) : ((var_1_7 % var_1_8)))) [L41] var_1_1 = var_1_9 VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L43] COND FALSE !(var_1_8 > var_1_1) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L48] signed long int stepLocal_1 = var_1_5; [L49] signed short int stepLocal_0 = var_1_1; VAL [isInitial=1, stepLocal_0=3, stepLocal_1=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L50] COND FALSE !(stepLocal_0 <= var_1_8) [L61] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_1=1, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L113] RET step() [L114] CALL, EXPR property() [L103-L104] return ((((((((var_1_3 - var_1_4)) > (var_1_2)) ? ((var_1_3 - var_1_4)) : (var_1_2))) <= (((((var_1_5 - var_1_6)) < ((var_1_7 % var_1_8))) ? ((var_1_5 - var_1_6)) : ((var_1_7 % var_1_8))))) ? (var_1_1 == ((signed short int) var_1_9)) : 1) && ((var_1_8 > var_1_1) ? ((var_1_1 == var_1_4) ? (var_1_10 == ((float) var_1_11)) : 1) : 1)) && ((var_1_1 <= var_1_8) ? ((var_1_5 != -64) ? (var_1_13 ? (var_1_12 == ((double) ((((var_1_14 - var_1_15) < 0 ) ? -(var_1_14 - var_1_15) : (var_1_14 - var_1_15))))) : (var_1_12 == ((double) (var_1_15 - var_1_14)))) : (var_1_12 == ((double) 32.8))) : (var_1_12 == ((double) var_1_11))) ; VAL [\result=0, isInitial=1, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=2, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 2, TraceHistogramMax: 22, 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, 86 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, 86 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 540 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1806/1848 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 13:23:02,799 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-1loop_file-80.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 2f49db024cf89bfd4f79528ea90efdc9ebcf8b7a9e599658c336eeffe7b60010 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:23:05,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:23:05,119 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:23:05,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:23:05,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:23:05,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:23:05,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:23:05,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:23:05,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:23:05,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:23:05,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:23:05,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:23:05,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:23:05,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:23:05,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:23:05,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:23:05,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:23:05,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:23:05,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:23:05,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:23:05,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:23:05,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:23:05,152 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:23:05,152 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:23:05,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:23:05,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:23:05,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:23:05,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:23:05,153 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 -> 2f49db024cf89bfd4f79528ea90efdc9ebcf8b7a9e599658c336eeffe7b60010 [2025-01-09 13:23:05,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:23:05,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:23:05,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:23:05,454 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:23:05,455 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:23:05,456 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-1loop_file-80.i [2025-01-09 13:23:06,813 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a16fff0b/274d510c26874dec80da1b9b2af75718/FLAG645036f5f [2025-01-09 13:23:07,033 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:23:07,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-80.i [2025-01-09 13:23:07,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a16fff0b/274d510c26874dec80da1b9b2af75718/FLAG645036f5f [2025-01-09 13:23:07,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a16fff0b/274d510c26874dec80da1b9b2af75718 [2025-01-09 13:23:07,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:23:07,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:23:07,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:23:07,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:23:07,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:23:07,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1426d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07, skipping insertion in model container [2025-01-09 13:23:07,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:23:07,524 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-1loop_file-80.i[915,928] [2025-01-09 13:23:07,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:23:07,576 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:23:07,586 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-1loop_file-80.i[915,928] [2025-01-09 13:23:07,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:23:07,634 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:23:07,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07 WrapperNode [2025-01-09 13:23:07,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:23:07,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:23:07,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:23:07,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:23:07,645 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:23:07" (1/1) ... [2025-01-09 13:23:07,657 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:23:07" (1/1) ... [2025-01-09 13:23:07,685 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-01-09 13:23:07,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:23:07,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:23:07,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:23:07,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:23:07,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,723 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:23:07,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,734 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:23:07,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:23:07,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:23:07,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:23:07,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (1/1) ... [2025-01-09 13:23:07,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:23:07,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:23:07,791 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:23:07,795 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:23:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:23:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:23:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:23:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:23:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:23:07,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:23:07,888 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:23:07,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:23:09,557 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 13:23:09,557 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:23:09,570 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:23:09,570 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:23:09,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:09 BoogieIcfgContainer [2025-01-09 13:23:09,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:23:09,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:23:09,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:23:09,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:23:09,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:23:07" (1/3) ... [2025-01-09 13:23:09,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d14a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:23:09, skipping insertion in model container [2025-01-09 13:23:09,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:07" (2/3) ... [2025-01-09 13:23:09,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d14a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:23:09, skipping insertion in model container [2025-01-09 13:23:09,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:09" (3/3) ... [2025-01-09 13:23:09,583 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-80.i [2025-01-09 13:23:09,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:23:09,596 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-80.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:23:09,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:23:09,644 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;@701baa80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:23:09,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:23:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:23:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 13:23:09,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:09,659 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:09,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:09,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash -947954708, now seen corresponding path program 1 times [2025-01-09 13:23:09,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:23:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647076877] [2025-01-09 13:23:09,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:09,674 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:23:09,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:23:09,677 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:23:09,678 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:23:09,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:23:10,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:23:10,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:10,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:10,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:23:10,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:23:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 13:23:10,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:23:10,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:23:10,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647076877] [2025-01-09 13:23:10,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647076877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:23:10,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:23:10,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:23:10,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488439432] [2025-01-09 13:23:10,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:23:10,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:23:10,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:23:10,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:23:10,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:23:10,110 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 13:23:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:23:10,129 INFO L93 Difference]: Finished difference Result 115 states and 195 transitions. [2025-01-09 13:23:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:23:10,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2025-01-09 13:23:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:23:10,137 INFO L225 Difference]: With dead ends: 115 [2025-01-09 13:23:10,138 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 13:23:10,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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:23:10,142 INFO L435 NwaCegarLoop]: 86 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, 86 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:23:10,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:23:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 13:23:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 13:23:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:23:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-01-09 13:23:10,176 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 135 [2025-01-09 13:23:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:23:10,176 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-01-09 13:23:10,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 13:23:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-01-09 13:23:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 13:23:10,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:10,179 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:10,190 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:23:10,384 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:23:10,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:10,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1283145832, now seen corresponding path program 1 times [2025-01-09 13:23:10,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:23:10,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737361477] [2025-01-09 13:23:10,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:10,386 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:23:10,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:23:10,389 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:23:10,391 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:23:10,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:23:10,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:23:10,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:10,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:10,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 13:23:10,750 INFO L279 TraceCheckSpWp]: Computing forward predicates...