./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.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 78cb2a64d376bc24725ded4a0eb9b996b458809ee92f4059e872faf6b1604d1d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:34:17,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:34:17,585 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:34:17,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:34:17,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:34:17,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:34:17,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:34:17,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:34:17,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:34:17,617 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:34:17,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:34:17,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:34:17,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:34:17,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:34:17,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:34:17,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:34:17,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:34:17,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:34:17,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:34:17,620 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 -> 78cb2a64d376bc24725ded4a0eb9b996b458809ee92f4059e872faf6b1604d1d [2025-01-09 13:34:17,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:34:17,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:34:17,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:34:17,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:34:17,887 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:34:17,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.i [2025-01-09 13:34:19,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62450e9a7/a816630cd7864eb48470ba9caec1022f/FLAGfca83ef7a [2025-01-09 13:34:19,323 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:34:19,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.i [2025-01-09 13:34:19,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62450e9a7/a816630cd7864eb48470ba9caec1022f/FLAGfca83ef7a [2025-01-09 13:34:19,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62450e9a7/a816630cd7864eb48470ba9caec1022f [2025-01-09 13:34:19,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:34:19,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:34:19,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:34:19,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:34:19,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:34:19,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e9330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19, skipping insertion in model container [2025-01-09 13:34:19,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:34:19,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.i[915,928] [2025-01-09 13:34:19,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:34:19,848 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:34:19,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.i[915,928] [2025-01-09 13:34:19,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:34:19,893 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:34:19,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19 WrapperNode [2025-01-09 13:34:19,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:34:19,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:34:19,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:34:19,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:34:19,900 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:34:19" (1/1) ... [2025-01-09 13:34:19,906 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:34:19" (1/1) ... [2025-01-09 13:34:19,936 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-01-09 13:34:19,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:34:19,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:34:19,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:34:19,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:34:19,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,962 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:34:19,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:34:19,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:34:19,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:34:19,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:34:19,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (1/1) ... [2025-01-09 13:34:19,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:34:20,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:34:20,026 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:34:20,033 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:34:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:34:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:34:20,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:34:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:34:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:34:20,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:34:20,116 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:34:20,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:34:20,270 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:34:20,271 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:34:20,276 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:34:20,277 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:34:20,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:34:20 BoogieIcfgContainer [2025-01-09 13:34:20,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:34:20,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:34:20,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:34:20,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:34:20,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:34:19" (1/3) ... [2025-01-09 13:34:20,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5039e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:34:20, skipping insertion in model container [2025-01-09 13:34:20,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:19" (2/3) ... [2025-01-09 13:34:20,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5039e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:34:20, skipping insertion in model container [2025-01-09 13:34:20,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:34:20" (3/3) ... [2025-01-09 13:34:20,283 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-75.i [2025-01-09 13:34:20,292 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:34:20,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-75.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:34:20,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:34:20,329 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;@247b531e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:34:20,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:34:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:34:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 13:34:20,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:34:20,341 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:20,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:34:20,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:34:20,346 INFO L85 PathProgramCache]: Analyzing trace with hash 148678595, now seen corresponding path program 1 times [2025-01-09 13:34:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:34:20,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618780013] [2025-01-09 13:34:20,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:34:20,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:34:20,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:34:20,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:34:20,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:34:20,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:34:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 13:34:20,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:34:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618780013] [2025-01-09 13:34:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618780013] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:34:20,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612126357] [2025-01-09 13:34:20,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:34:20,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:34:20,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:34:20,588 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:34:20,590 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:34:20,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:34:20,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:34:20,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:34:20,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:34:20,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:34:20,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:34:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 13:34:20,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:34:20,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612126357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:34:20,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:34:20,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:34:20,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6006638] [2025-01-09 13:34:20,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:34:20,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:34:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:34:20,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:34:20,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:34:20,731 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:34:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:34:20,759 INFO L93 Difference]: Finished difference Result 84 states and 135 transitions. [2025-01-09 13:34:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:34:20,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-01-09 13:34:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:34:20,765 INFO L225 Difference]: With dead ends: 84 [2025-01-09 13:34:20,766 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 13:34:20,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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:34:20,769 INFO L435 NwaCegarLoop]: 58 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, 58 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:34:20,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:34:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 13:34:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 13:34:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:34:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-01-09 13:34:20,791 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 92 [2025-01-09 13:34:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:34:20,791 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-01-09 13:34:20,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:34:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-01-09 13:34:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 13:34:20,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:34:20,794 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:20,800 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:34:20,994 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:34:20,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:34:20,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:34:20,995 INFO L85 PathProgramCache]: Analyzing trace with hash 660759163, now seen corresponding path program 1 times [2025-01-09 13:34:20,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:34:20,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393577147] [2025-01-09 13:34:20,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:34:20,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:34:21,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:34:21,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:34:21,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:34:21,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:34:21,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530404274] [2025-01-09 13:34:21,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:34:21,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:34:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:34:21,087 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:34:21,088 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:34:21,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:34:21,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:34:21,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:34:21,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:34:21,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:34:21,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:34:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:34:21,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:34:21,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:34:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393577147] [2025-01-09 13:34:21,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 13:34:21,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530404274] [2025-01-09 13:34:21,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530404274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:34:21,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:34:21,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:34:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627891787] [2025-01-09 13:34:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:34:21,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:34:21,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:34:21,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:34:21,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:34:21,323 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:34:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:34:21,418 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2025-01-09 13:34:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:34:21,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-01-09 13:34:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:34:21,420 INFO L225 Difference]: With dead ends: 121 [2025-01-09 13:34:21,420 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 13:34:21,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:34:21,421 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:34:21,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 179 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:34:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 13:34:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2025-01-09 13:34:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:34:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2025-01-09 13:34:21,432 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 92 [2025-01-09 13:34:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:34:21,433 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2025-01-09 13:34:21,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:34:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2025-01-09 13:34:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 13:34:21,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:34:21,435 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:21,441 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:34:21,639 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:34:21,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:34:21,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:34:21,639 INFO L85 PathProgramCache]: Analyzing trace with hash -148587463, now seen corresponding path program 1 times [2025-01-09 13:34:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:34:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537326313] [2025-01-09 13:34:21,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:34:21,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:34:21,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:34:21,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:34:21,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:34:21,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:34:21,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862454308] [2025-01-09 13:34:21,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:34:21,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:34:21,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:34:21,742 INFO L229 MonitoredProcess]: Starting monitored process 4 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:34:21,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 13:34:21,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:34:21,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:34:21,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:34:21,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:34:21,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:34:21,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:34:21,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:34:21,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:34:21,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:34:21,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:34:21,889 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:34:21,890 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:34:21,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 13:34:22,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:34:22,096 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 13:34:22,166 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:34:22,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:34:22 BoogieIcfgContainer [2025-01-09 13:34:22,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:34:22,173 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:34:22,173 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:34:22,173 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:34:22,174 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:34:20" (3/4) ... [2025-01-09 13:34:22,176 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:34:22,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:34:22,178 INFO L158 Benchmark]: Toolchain (without parser) took 2520.34ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 105.8MB in the end (delta: 1.0MB). Peak memory consumption was 180.9kB. Max. memory is 16.1GB. [2025-01-09 13:34:22,178 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:34:22,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.26ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 93.8MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:34:22,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.80ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 90.5MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:34:22,183 INFO L158 Benchmark]: Boogie Preprocessor took 42.61ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 85.2MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:34:22,183 INFO L158 Benchmark]: RCFGBuilder took 293.22ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 67.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:34:22,183 INFO L158 Benchmark]: TraceAbstraction took 1893.80ms. Allocated memory is still 142.6MB. Free memory was 66.4MB in the beginning and 105.8MB in the end (delta: -39.5MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-01-09 13:34:22,183 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 105.8MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:34:22,184 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.26ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 93.8MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.80ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 90.5MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.61ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 85.2MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 293.22ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 67.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1893.80ms. Allocated memory is still 142.6MB. Free memory was 66.4MB in the beginning and 105.8MB in the end (delta: -39.5MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 105.8MB in the end (delta: 37.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 51, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] unsigned char var_1_7 = 128; [L24] unsigned char var_1_8 = 64; [L25] unsigned char var_1_9 = 100; [L26] unsigned char var_1_10 = 1; [L27] float var_1_11 = -0.6; [L28] unsigned char var_1_12 = 1; [L29] double var_1_13 = 999999999999999.2; [L30] float var_1_14 = 50.25; [L31] float var_1_15 = 15.5; [L32] float var_1_16 = 128.5; [L33] unsigned char var_1_17 = 0; [L34] unsigned char last_1_var_1_17 = 0; VAL [isInitial=0, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=128, var_1_8=64, var_1_9=100] [L89] isInitial = 1 [L90] FCALL initially() [L92] CALL updateLastVariables() [L82] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=128, var_1_8=64, var_1_9=100] [L92] RET updateLastVariables() [L93] CALL updateVariables() [L57] var_1_7 = __VERIFIER_nondet_uchar() [L58] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L58] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L59] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L59] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L60] var_1_8 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_8 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=100] [L61] RET assume_abort_if_not(var_1_8 >= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=100] [L62] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=100] [L62] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=100] [L63] var_1_9 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L64] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L65] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L65] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L66] var_1_10 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L67] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L68] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L68] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L69] var_1_12 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L70] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L71] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L71] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L72] var_1_13 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L73] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L74] var_1_14 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L75] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L76] var_1_15 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L77] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L78] var_1_16 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L79] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L93] RET updateVariables() [L94] CALL step() [L38] signed long int stepLocal_0 = (last_1_var_1_17 * last_1_var_1_17) * last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=0, stepLocal_0=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=-193, var_1_9=63] [L39] COND FALSE !(stepLocal_0 < ((((last_1_var_1_17) > (last_1_var_1_17)) ? (last_1_var_1_17) : (last_1_var_1_17)))) [L42] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=-193, var_1_7=-129, var_1_8=-193, var_1_9=63] [L44] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_17=0, stepLocal_1=-193, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=-193, var_1_7=-129, var_1_8=-193, var_1_9=63] [L45] COND TRUE stepLocal_1 >= var_1_1 [L46] var_1_17 = (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - (((((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) < 0 ) ? -((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) : ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=64, var_1_1=-193, var_1_7=-129, var_1_8=-193, var_1_9=63] [L50] COND TRUE var_1_12 || ((var_1_13 * 49.25) == 32.8) [L51] var_1_11 = (((((var_1_14 + var_1_15)) > (var_1_16)) ? ((var_1_14 + var_1_15)) : (var_1_16))) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=64, var_1_1=-193, var_1_7=-129, var_1_8=-193, var_1_9=63] [L94] RET step() [L95] CALL, EXPR property() [L85-L86] return (((((last_1_var_1_17 * last_1_var_1_17) * last_1_var_1_17) < ((((last_1_var_1_17) > (last_1_var_1_17)) ? (last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_1 == ((unsigned char) (var_1_7 - (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)))) : (var_1_1 == ((unsigned char) var_1_8))) && ((var_1_12 || ((var_1_13 * 49.25) == 32.8)) ? (var_1_11 == ((float) (((((var_1_14 + var_1_15)) > (var_1_16)) ? ((var_1_14 + var_1_15)) : (var_1_16))))) : (var_1_11 == ((float) var_1_15)))) && ((var_1_1 >= var_1_1) ? (var_1_17 == ((unsigned char) (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - (((((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) < 0 ) ? -((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) : ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))))) : (var_1_17 == ((unsigned char) var_1_8))) ; VAL [\result=0, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=64, var_1_1=-193, var_1_7=-129, var_1_8=-193, var_1_9=63] [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=64, var_1_1=-193, var_1_7=-129, var_1_8=-193, var_1_9=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=64, var_1_1=-193, var_1_7=-129, var_1_8=-193, var_1_9=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 112 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 445 SizeOfPredicates, 1 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1066/1092 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:34:22,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.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 78cb2a64d376bc24725ded4a0eb9b996b458809ee92f4059e872faf6b1604d1d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:34:24,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:34:24,331 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:34:24,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:34:24,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:34:24,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:34:24,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:34:24,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:34:24,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:34:24,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:34:24,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:34:24,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:34:24,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:34:24,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:34:24,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:34:24,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:34:24,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:34:24,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:34:24,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:34:24,353 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:34:24,353 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:34:24,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:34:24,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:34:24,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:34:24,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:34:24,353 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 -> 78cb2a64d376bc24725ded4a0eb9b996b458809ee92f4059e872faf6b1604d1d [2025-01-09 13:34:24,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:34:24,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:34:24,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:34:24,569 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:34:24,569 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:34:24,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.i [2025-01-09 13:34:25,810 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e497da0/150fc9e39f5a4147b05945711045104e/FLAG1486b6aeb [2025-01-09 13:34:26,020 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:34:26,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.i [2025-01-09 13:34:26,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e497da0/150fc9e39f5a4147b05945711045104e/FLAG1486b6aeb [2025-01-09 13:34:26,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e497da0/150fc9e39f5a4147b05945711045104e [2025-01-09 13:34:26,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:34:26,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:34:26,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:34:26,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:34:26,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:34:26,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cae0d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26, skipping insertion in model container [2025-01-09 13:34:26,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:34:26,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.i[915,928] [2025-01-09 13:34:26,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:34:26,243 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:34:26,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-75.i[915,928] [2025-01-09 13:34:26,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:34:26,276 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:34:26,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26 WrapperNode [2025-01-09 13:34:26,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:34:26,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:34:26,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:34:26,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:34:26,283 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:34:26" (1/1) ... [2025-01-09 13:34:26,290 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:34:26" (1/1) ... [2025-01-09 13:34:26,305 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-01-09 13:34:26,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:34:26,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:34:26,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:34:26,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:34:26,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,323 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:34:26,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:34:26,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:34:26,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:34:26,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:34:26,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (1/1) ... [2025-01-09 13:34:26,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:34:26,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:34:26,367 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:34:26,373 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:34:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:34:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:34:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:34:26,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:34:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:34:26,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:34:26,445 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:34:26,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:34:27,959 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:34:27,959 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:34:27,968 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:34:27,969 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:34:27,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:34:27 BoogieIcfgContainer [2025-01-09 13:34:27,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:34:27,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:34:27,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:34:27,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:34:27,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:34:26" (1/3) ... [2025-01-09 13:34:27,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608a4fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:34:27, skipping insertion in model container [2025-01-09 13:34:27,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:34:26" (2/3) ... [2025-01-09 13:34:27,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608a4fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:34:27, skipping insertion in model container [2025-01-09 13:34:27,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:34:27" (3/3) ... [2025-01-09 13:34:27,980 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-75.i [2025-01-09 13:34:27,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:34:27,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-75.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:34:28,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:34:28,043 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;@1f9f0077, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:34:28,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:34:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:34:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 13:34:28,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:34:28,054 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:28,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:34:28,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:34:28,058 INFO L85 PathProgramCache]: Analyzing trace with hash 148678595, now seen corresponding path program 1 times [2025-01-09 13:34:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:34:28,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055402580] [2025-01-09 13:34:28,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:34:28,066 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:34:28,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:34:28,070 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:34:28,072 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:34:28,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:34:28,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:34:28,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:34:28,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:34:28,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:34:28,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:34:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-01-09 13:34:28,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:34:28,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:34:28,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055402580] [2025-01-09 13:34:28,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055402580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:34:28,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:34:28,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:34:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965576263] [2025-01-09 13:34:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:34:28,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:34:28,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:34:28,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:34:28,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:34:28,391 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:34:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:34:28,409 INFO L93 Difference]: Finished difference Result 84 states and 135 transitions. [2025-01-09 13:34:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:34:28,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-01-09 13:34:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:34:28,418 INFO L225 Difference]: With dead ends: 84 [2025-01-09 13:34:28,418 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 13:34:28,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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:34:28,424 INFO L435 NwaCegarLoop]: 58 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, 58 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:34:28,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:34:28,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 13:34:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 13:34:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:34:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-01-09 13:34:28,477 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 92 [2025-01-09 13:34:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:34:28,477 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-01-09 13:34:28,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:34:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-01-09 13:34:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 13:34:28,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:34:28,479 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:28,489 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:34:28,684 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:34:28,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:34:28,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:34:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash 660759163, now seen corresponding path program 1 times [2025-01-09 13:34:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:34:28,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804153121] [2025-01-09 13:34:28,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:34:28,686 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:34:28,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:34:28,688 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:34:28,688 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:34:28,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:34:28,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:34:28,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:34:28,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:34:28,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 13:34:28,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:34:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:34:29,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:34:29,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:34:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804153121] [2025-01-09 13:34:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804153121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:34:29,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:34:29,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:34:29,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830710898] [2025-01-09 13:34:29,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:34:29,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:34:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:34:29,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:34:29,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:34:29,078 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:34:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:34:29,948 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2025-01-09 13:34:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:34:29,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-01-09 13:34:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:34:29,958 INFO L225 Difference]: With dead ends: 121 [2025-01-09 13:34:29,958 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 13:34:29,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:34:29,959 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 13:34:29,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 179 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 13:34:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 13:34:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2025-01-09 13:34:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:34:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2025-01-09 13:34:29,970 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 92 [2025-01-09 13:34:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:34:29,971 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2025-01-09 13:34:29,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:34:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2025-01-09 13:34:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 13:34:29,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:34:29,972 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:29,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 13:34:30,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:34:30,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:34:30,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:34:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash -148587463, now seen corresponding path program 1 times [2025-01-09 13:34:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:34:30,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109575933] [2025-01-09 13:34:30,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:34:30,175 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:34:30,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:34:30,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:34:30,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 13:34:30,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:34:30,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:34:30,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:34:30,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:34:30,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 13:34:30,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:34:49,344 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)