./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.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 ea5fa9597dfb355e2134f9e9e075c4e3ca829d1649455c17a870875ad29bc269 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:19:54,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:19:54,102 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:19:54,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:19:54,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:19:54,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:19:54,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:19:54,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:19:54,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:19:54,138 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:19:54,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:19:54,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:19:54,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:19:54,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:19:54,140 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:19:54,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:19:54,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:19:54,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:19:54,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:19:54,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:19:54,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:19:54,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:19:54,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:19:54,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:19:54,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:19:54,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:19:54,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:19:54,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:19:54,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:19:54,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:54,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:54,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:54,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:54,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:19:54,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:54,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:54,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:54,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:54,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:19:54,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:19:54,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:19:54,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:19:54,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:19:54,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:19:54,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:19:54,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:19:54,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:19:54,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:19:54,143 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 -> ea5fa9597dfb355e2134f9e9e075c4e3ca829d1649455c17a870875ad29bc269 [2025-01-09 13:19:54,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:19:54,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:19:54,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:19:54,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:19:54,389 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:19:54,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i [2025-01-09 13:19:55,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d499d244/f7b68a84157a48c4aaf5b9ea304b5c4b/FLAG8c85143a0 [2025-01-09 13:19:55,839 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:19:55,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i [2025-01-09 13:19:55,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d499d244/f7b68a84157a48c4aaf5b9ea304b5c4b/FLAG8c85143a0 [2025-01-09 13:19:56,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d499d244/f7b68a84157a48c4aaf5b9ea304b5c4b [2025-01-09 13:19:56,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:19:56,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:19:56,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:56,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:19:56,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:19:56,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a8cb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56, skipping insertion in model container [2025-01-09 13:19:56,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:19:56,222 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i[915,928] [2025-01-09 13:19:56,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:56,253 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:19:56,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i[915,928] [2025-01-09 13:19:56,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:56,282 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:19:56,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56 WrapperNode [2025-01-09 13:19:56,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:56,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:56,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:19:56,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:19:56,287 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:19:56" (1/1) ... [2025-01-09 13:19:56,291 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:19:56" (1/1) ... [2025-01-09 13:19:56,321 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2025-01-09 13:19:56,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:56,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:19:56,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:19:56,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:19:56,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,351 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:19:56,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:19:56,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:19:56,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:19:56,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:19:56,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (1/1) ... [2025-01-09 13:19:56,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:56,407 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:19:56,409 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:19:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:19:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:19:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:19:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:19:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:19:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:19:56,469 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:19:56,470 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:19:56,642 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 13:19:56,642 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:19:56,648 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:19:56,648 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:19:56,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:56 BoogieIcfgContainer [2025-01-09 13:19:56,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:19:56,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:19:56,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:19:56,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:19:56,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:19:56" (1/3) ... [2025-01-09 13:19:56,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35506679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:56, skipping insertion in model container [2025-01-09 13:19:56,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:56" (2/3) ... [2025-01-09 13:19:56,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35506679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:56, skipping insertion in model container [2025-01-09 13:19:56,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:56" (3/3) ... [2025-01-09 13:19:56,655 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-56.i [2025-01-09 13:19:56,669 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:19:56,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-56.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:19:56,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:19:56,720 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;@54ae0754, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:19:56,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:19:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:19:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 13:19:56,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:56,728 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:19:56,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:56,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:56,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1363898031, now seen corresponding path program 1 times [2025-01-09 13:19:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:56,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98806367] [2025-01-09 13:19:56,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:56,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:56,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 13:19:56,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 13:19:56,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:56,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:19:56,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:56,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98806367] [2025-01-09 13:19:56,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98806367] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:19:56,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655716229] [2025-01-09 13:19:56,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:56,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:56,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:56,889 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:19:56,892 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:19:56,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 13:19:56,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 13:19:56,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:56,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:56,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:19:56,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:19:56,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:19:56,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655716229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:56,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:19:56,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:19:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889461990] [2025-01-09 13:19:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:56,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:19:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:56,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:19:56,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:19:56,993 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 13:19:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:57,005 INFO L93 Difference]: Finished difference Result 87 states and 133 transitions. [2025-01-09 13:19:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:19:57,006 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2025-01-09 13:19:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:57,009 INFO L225 Difference]: With dead ends: 87 [2025-01-09 13:19:57,009 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 13:19:57,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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:19:57,013 INFO L435 NwaCegarLoop]: 61 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, 61 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:19:57,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:19:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 13:19:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 13:19:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:19:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-01-09 13:19:57,034 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 72 [2025-01-09 13:19:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:57,034 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-01-09 13:19:57,034 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 13:19:57,034 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-01-09 13:19:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 13:19:57,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:57,036 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:19:57,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:19:57,240 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:19:57,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:57,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1980082193, now seen corresponding path program 1 times [2025-01-09 13:19:57,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:57,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900895593] [2025-01-09 13:19:57,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:57,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 13:19:57,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 13:19:57,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:57,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 13:19:57,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:57,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900895593] [2025-01-09 13:19:57,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900895593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:57,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:57,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:19:57,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043356169] [2025-01-09 13:19:57,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:57,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:19:57,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:57,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:19:57,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:19:57,910 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), 5 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:19:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:58,049 INFO L93 Difference]: Finished difference Result 119 states and 167 transitions. [2025-01-09 13:19:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:19:58,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2025-01-09 13:19:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:58,050 INFO L225 Difference]: With dead ends: 119 [2025-01-09 13:19:58,050 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 13:19:58,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:19:58,051 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 36 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:58,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 165 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:19:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 13:19:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-01-09 13:19:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 13:19:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2025-01-09 13:19:58,060 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 72 [2025-01-09 13:19:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:58,060 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2025-01-09 13:19:58,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:19:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2025-01-09 13:19:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 13:19:58,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:58,062 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:19:58,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:19:58,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:58,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:58,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1613820525, now seen corresponding path program 1 times [2025-01-09 13:19:58,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:58,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569203935] [2025-01-09 13:19:58,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:58,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:58,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 13:19:58,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 13:19:58,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:58,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 13:19:59,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569203935] [2025-01-09 13:19:59,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569203935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:59,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:59,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:19:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286521288] [2025-01-09 13:19:59,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:59,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:19:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:59,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:19:59,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:19:59,368 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:19:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:59,966 INFO L93 Difference]: Finished difference Result 108 states and 148 transitions. [2025-01-09 13:19:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:19:59,967 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2025-01-09 13:19:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:59,968 INFO L225 Difference]: With dead ends: 108 [2025-01-09 13:19:59,968 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 13:19:59,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:19:59,969 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:59,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 259 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:19:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 13:19:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2025-01-09 13:19:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 13:19:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2025-01-09 13:19:59,977 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 72 [2025-01-09 13:19:59,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:59,978 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-01-09 13:19:59,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:19:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2025-01-09 13:19:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 13:19:59,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:59,979 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:19:59,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:19:59,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:59,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash -326002327, now seen corresponding path program 1 times [2025-01-09 13:19:59,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:59,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046926451] [2025-01-09 13:19:59,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:59,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:59,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 13:20:00,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 13:20:00,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:00,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 13:20:01,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:20:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046926451] [2025-01-09 13:20:01,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046926451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:20:01,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:20:01,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:20:01,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553836904] [2025-01-09 13:20:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:20:01,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:20:01,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:20:01,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:20:01,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:20:01,313 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:20:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:20:01,936 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2025-01-09 13:20:01,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:20:01,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2025-01-09 13:20:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:20:01,938 INFO L225 Difference]: With dead ends: 106 [2025-01-09 13:20:01,938 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 13:20:01,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:20:01,939 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 30 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:20:01,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 271 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:20:01,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 13:20:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2025-01-09 13:20:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 states have internal predecessors, (81), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 13:20:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2025-01-09 13:20:01,950 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 73 [2025-01-09 13:20:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:20:01,950 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2025-01-09 13:20:01,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:20:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2025-01-09 13:20:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 13:20:01,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:20:01,951 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:20:01,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:20:01,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:20:01,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:20:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1181865378, now seen corresponding path program 1 times [2025-01-09 13:20:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:20:01,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407601045] [2025-01-09 13:20:01,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:20:01,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 13:20:01,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 13:20:01,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:01,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:20:02,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:20:02,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407601045] [2025-01-09 13:20:02,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407601045] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:20:02,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091880967] [2025-01-09 13:20:02,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:02,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:20:02,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:20:02,051 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:20:02,053 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:20:02,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 13:20:02,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 13:20:02,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:02,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:02,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 13:20:02,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:20:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-01-09 13:20:02,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:20:02,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091880967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:20:02,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:20:02,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 13:20:02,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866750619] [2025-01-09 13:20:02,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:20:02,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:20:02,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:20:02,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:20:02,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:20:02,171 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 13:20:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:20:02,195 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2025-01-09 13:20:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:20:02,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-01-09 13:20:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:20:02,198 INFO L225 Difference]: With dead ends: 91 [2025-01-09 13:20:02,198 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 13:20:02,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:20:02,199 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:20:02,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 100 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:20:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 13:20:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 13:20:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 13:20:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 13:20:02,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2025-01-09 13:20:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:20:02,200 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 13:20:02,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 13:20:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 13:20:02,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 13:20:02,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:20:02,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:20:02,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:20:02,409 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 13:20:02,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 13:20:02,536 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:20:02,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:20:02 BoogieIcfgContainer [2025-01-09 13:20:02,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:20:02,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:20:02,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:20:02,545 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:20:02,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:56" (3/4) ... [2025-01-09 13:20:02,547 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 13:20:02,551 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 13:20:02,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 13:20:02,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 13:20:02,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 13:20:02,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 13:20:02,620 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 13:20:02,621 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 13:20:02,621 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:20:02,622 INFO L158 Benchmark]: Toolchain (without parser) took 6496.11ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 123.1MB in the beginning and 126.1MB in the end (delta: -2.9MB). Peak memory consumption was 177.7MB. Max. memory is 16.1GB. [2025-01-09 13:20:02,626 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:20:02,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.83ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 110.2MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:20:02,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.22ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 107.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:20:02,626 INFO L158 Benchmark]: Boogie Preprocessor took 54.19ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 103.1MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:20:02,626 INFO L158 Benchmark]: RCFGBuilder took 271.98ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 85.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:20:02,626 INFO L158 Benchmark]: TraceAbstraction took 5893.93ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 84.8MB in the beginning and 133.6MB in the end (delta: -48.8MB). Peak memory consumption was 135.7MB. Max. memory is 16.1GB. [2025-01-09 13:20:02,627 INFO L158 Benchmark]: Witness Printer took 76.15ms. Allocated memory is still 352.3MB. Free memory was 133.6MB in the beginning and 126.1MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:20:02,628 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.83ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 110.2MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.22ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 107.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.19ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 103.1MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 271.98ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 85.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5893.93ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 84.8MB in the beginning and 133.6MB in the end (delta: -48.8MB). Peak memory consumption was 135.7MB. Max. memory is 16.1GB. * Witness Printer took 76.15ms. Allocated memory is still 352.3MB. Free memory was 133.6MB in the beginning and 126.1MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 856 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 603 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 489 IncrementalHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 253 mSDtfsCounter, 489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=3, InterpolantAutomatonStates: 30, 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, 5 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 643 NumberOfCodeBlocks, 643 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 636 ConstructedInterpolants, 0 QuantifiedInterpolants, 1994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 511 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 2457/2476 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((((var_1_1 == 1) && (last_1_var_1_1 == 1)) && (k_loop == 0)) && (var_1_11 == 0)) && (last_1_var_1_11 == 0)) || (0 < k_loop)) RESULT: Ultimate proved your program to be correct! [2025-01-09 13:20:02,664 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 Writing output log to file Ultimate.log Result: TRUE