./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.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_variablewrapping_wrapper-a_file-19.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 81c7729345d5d6e6cfdedd64c331a4f8f6005773af2c566c0c24cc964b2ec390 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:18:51,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:18:51,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:18:51,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:18:51,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:18:51,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:18:51,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:18:51,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:18:51,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:18:51,597 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:18:51,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:18:51,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:18:51,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:18:51,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:18:51,599 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:18:51,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:18:51,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:18:51,600 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:18:51,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:18:51,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:18:51,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:18:51,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:18:51,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:18:51,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:18:51,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:18:51,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:18:51,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:18:51,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:18:51,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:18:51,602 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:18:51,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:18:51,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:18:51,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:18:51,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:18:51,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:18:51,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:18:51,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:18:51,603 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 -> 81c7729345d5d6e6cfdedd64c331a4f8f6005773af2c566c0c24cc964b2ec390 [2025-01-09 15:18:51,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:18:51,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:18:51,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:18:51,881 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:18:51,882 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:18:51,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i [2025-01-09 15:18:53,244 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16e26909f/beb445caf1ca4d2a975f9f5edaec5733/FLAGdc76f20cc [2025-01-09 15:18:53,511 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:18:53,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i [2025-01-09 15:18:53,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16e26909f/beb445caf1ca4d2a975f9f5edaec5733/FLAGdc76f20cc [2025-01-09 15:18:53,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16e26909f/beb445caf1ca4d2a975f9f5edaec5733 [2025-01-09 15:18:53,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:18:53,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:18:53,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:18:53,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:18:53,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:18:53,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:18:53" (1/1) ... [2025-01-09 15:18:53,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:53, skipping insertion in model container [2025-01-09 15:18:53,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:18:53" (1/1) ... [2025-01-09 15:18:53,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:18:53,943 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_variablewrapping_wrapper-a_file-19.i[916,929] [2025-01-09 15:18:54,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:18:54,032 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:18:54,041 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_variablewrapping_wrapper-a_file-19.i[916,929] [2025-01-09 15:18:54,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:18:54,107 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:18:54,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54 WrapperNode [2025-01-09 15:18:54,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:18:54,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:18:54,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:18:54,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:18:54,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,185 INFO L138 Inliner]: procedures = 26, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2025-01-09 15:18:54,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:18:54,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:18:54,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:18:54,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:18:54,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,238 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 8, 43, 27, 26, 18]. 35 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 3, 4, 2, 2]. The 15 writes are split as follows [0, 1, 4, 6, 2, 2]. [2025-01-09 15:18:54,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:18:54,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:18:54,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:18:54,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:18:54,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (1/1) ... [2025-01-09 15:18:54,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:18:54,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:18:54,313 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 15:18:54,318 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 15:18:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:18:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:18:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:18:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:18:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:18:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:18:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:18:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:18:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:18:54,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:18:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:18:54,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:18:54,461 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:18:54,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:18:54,895 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-01-09 15:18:54,895 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:18:54,908 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:18:54,908 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:18:54,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:18:54 BoogieIcfgContainer [2025-01-09 15:18:54,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:18:54,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:18:54,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:18:54,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:18:54,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:18:53" (1/3) ... [2025-01-09 15:18:54,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb6a6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:18:54, skipping insertion in model container [2025-01-09 15:18:54,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:54" (2/3) ... [2025-01-09 15:18:54,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb6a6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:18:54, skipping insertion in model container [2025-01-09 15:18:54,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:18:54" (3/3) ... [2025-01-09 15:18:54,923 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-19.i [2025-01-09 15:18:54,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:18:54,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-19.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:18:54,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:18:55,006 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;@66c0bf05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:18:55,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:18:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:18:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:18:55,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:55,023 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:18:55,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:55,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:55,028 INFO L85 PathProgramCache]: Analyzing trace with hash -829434461, now seen corresponding path program 1 times [2025-01-09 15:18:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:55,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516458736] [2025-01-09 15:18:55,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:55,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:18:55,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:18:55,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:55,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 15:18:55,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516458736] [2025-01-09 15:18:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516458736] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:18:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850839079] [2025-01-09 15:18:55,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:55,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:18:55,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:18:55,402 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 15:18:55,403 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 15:18:55,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:18:55,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:18:55,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:55,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:55,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:18:55,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:18:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 15:18:55,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:18:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850839079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:55,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:18:55,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:18:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641471141] [2025-01-09 15:18:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:55,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:18:55,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:55,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:18:55,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:18:55,716 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:18:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:55,741 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2025-01-09 15:18:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:18:55,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-01-09 15:18:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:55,750 INFO L225 Difference]: With dead ends: 196 [2025-01-09 15:18:55,751 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 15:18:55,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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 15:18:55,759 INFO L435 NwaCegarLoop]: 139 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, 139 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 15:18:55,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:18:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 15:18:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 15:18:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:18:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2025-01-09 15:18:55,798 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 132 [2025-01-09 15:18:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:55,798 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2025-01-09 15:18:55,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:18:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2025-01-09 15:18:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:18:55,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:55,801 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:18:55,808 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 15:18:56,002 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 15:18:56,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash 651305669, now seen corresponding path program 1 times [2025-01-09 15:18:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:56,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942678817] [2025-01-09 15:18:56,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:56,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:18:56,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:18:56,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:56,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:18:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:56,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942678817] [2025-01-09 15:18:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942678817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:56,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:18:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912658488] [2025-01-09 15:18:56,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:56,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:18:56,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:56,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:18:56,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:18:56,445 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:18:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:56,501 INFO L93 Difference]: Finished difference Result 196 states and 279 transitions. [2025-01-09 15:18:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:18:56,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-01-09 15:18:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:56,508 INFO L225 Difference]: With dead ends: 196 [2025-01-09 15:18:56,509 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 15:18:56,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:18:56,511 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:56,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 399 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:18:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 15:18:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-01-09 15:18:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:18:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2025-01-09 15:18:56,527 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 132 [2025-01-09 15:18:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:56,531 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2025-01-09 15:18:56,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:18:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2025-01-09 15:18:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:18:56,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:56,535 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:18:56,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:18:56,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:56,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 653152711, now seen corresponding path program 1 times [2025-01-09 15:18:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:56,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172596956] [2025-01-09 15:18:56,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:56,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:56,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:18:56,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:18:56,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:56,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:18:57,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172596956] [2025-01-09 15:18:57,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172596956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:57,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:57,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:18:57,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265885820] [2025-01-09 15:18:57,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:57,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:18:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:57,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:18:57,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:18:57,305 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:18:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:57,405 INFO L93 Difference]: Finished difference Result 237 states and 333 transitions. [2025-01-09 15:18:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:18:57,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-01-09 15:18:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:57,410 INFO L225 Difference]: With dead ends: 237 [2025-01-09 15:18:57,410 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 15:18:57,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:18:57,411 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 94 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:57,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 518 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:18:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 15:18:57,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2025-01-09 15:18:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 87 states have internal predecessors, (115), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:18:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 149 transitions. [2025-01-09 15:18:57,429 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 149 transitions. Word has length 132 [2025-01-09 15:18:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:57,430 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 149 transitions. [2025-01-09 15:18:57,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:18:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 149 transitions. [2025-01-09 15:18:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:18:57,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:57,436 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:18:57,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:18:57,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:57,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 911318149, now seen corresponding path program 1 times [2025-01-09 15:18:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087569321] [2025-01-09 15:18:57,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:57,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:18:57,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:18:57,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:57,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:18:57,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087569321] [2025-01-09 15:18:57,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087569321] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:18:57,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921236543] [2025-01-09 15:18:57,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:57,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:18:57,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:18:57,710 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 15:18:57,712 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 15:18:57,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:18:57,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:18:57,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:57,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:57,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:18:57,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:18:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:18:57,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:18:57,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921236543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:57,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:18:57,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-01-09 15:18:57,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332822079] [2025-01-09 15:18:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:57,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:18:57,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:57,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:18:57,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:18:57,969 INFO L87 Difference]: Start difference. First operand 106 states and 149 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:18:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:58,012 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2025-01-09 15:18:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:18:58,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-01-09 15:18:58,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:58,016 INFO L225 Difference]: With dead ends: 212 [2025-01-09 15:18:58,018 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:18:58,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:18:58,019 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:58,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 529 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:18:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:18:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 15:18:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:18:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 152 transitions. [2025-01-09 15:18:58,036 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 152 transitions. Word has length 132 [2025-01-09 15:18:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:58,037 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 152 transitions. [2025-01-09 15:18:58,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:18:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 152 transitions. [2025-01-09 15:18:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:18:58,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:58,041 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:18:58,050 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 15:18:58,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:18:58,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:58,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:58,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2053466683, now seen corresponding path program 1 times [2025-01-09 15:18:58,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:58,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796081279] [2025-01-09 15:18:58,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:58,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:18:58,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:18:58,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:58,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:18:59,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:59,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796081279] [2025-01-09 15:18:59,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796081279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:59,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:59,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:18:59,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934123773] [2025-01-09 15:18:59,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:59,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:18:59,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:59,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:18:59,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:18:59,490 INFO L87 Difference]: Start difference. First operand 109 states and 152 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:18:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:59,920 INFO L93 Difference]: Finished difference Result 290 states and 403 transitions. [2025-01-09 15:18:59,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:18:59,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-01-09 15:18:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:59,923 INFO L225 Difference]: With dead ends: 290 [2025-01-09 15:18:59,923 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 15:18:59,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:18:59,924 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 89 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:59,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1472 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:18:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 15:18:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2025-01-09 15:18:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 145 states have (on average 1.296551724137931) internal successors, (188), 146 states have internal predecessors, (188), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:18:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 248 transitions. [2025-01-09 15:18:59,949 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 248 transitions. Word has length 132 [2025-01-09 15:18:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:59,949 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 248 transitions. [2025-01-09 15:18:59,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:18:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 248 transitions. [2025-01-09 15:18:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:18:59,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:59,951 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:18:59,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:18:59,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:59,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:59,952 INFO L85 PathProgramCache]: Analyzing trace with hash 11325225, now seen corresponding path program 1 times [2025-01-09 15:18:59,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:59,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597992877] [2025-01-09 15:18:59,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:59,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:59,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:19:00,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:19:00,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:00,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:19:00,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:00,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597992877] [2025-01-09 15:19:00,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597992877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:00,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:00,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:19:00,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102533653] [2025-01-09 15:19:00,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:00,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:19:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:00,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:19:00,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:19:00,500 INFO L87 Difference]: Start difference. First operand 178 states and 248 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:19:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:00,959 INFO L93 Difference]: Finished difference Result 467 states and 645 transitions. [2025-01-09 15:19:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:19:00,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-01-09 15:19:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:00,965 INFO L225 Difference]: With dead ends: 467 [2025-01-09 15:19:00,966 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 15:19:00,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:19:00,967 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 76 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:00,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 754 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:19:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 15:19:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2025-01-09 15:19:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 238 states have internal predecessors, (299), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:19:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2025-01-09 15:19:01,013 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 133 [2025-01-09 15:19:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:01,014 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2025-01-09 15:19:01,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:19:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2025-01-09 15:19:01,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:19:01,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:01,016 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:01,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:19:01,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:01,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:01,017 INFO L85 PathProgramCache]: Analyzing trace with hash -310085773, now seen corresponding path program 1 times [2025-01-09 15:19:01,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:01,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106597556] [2025-01-09 15:19:01,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:01,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:01,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:19:01,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:19:01,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:01,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:19:02,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106597556] [2025-01-09 15:19:02,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106597556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:02,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:02,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:19:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958933275] [2025-01-09 15:19:02,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:02,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:19:02,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:02,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:19:02,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:19:02,378 INFO L87 Difference]: Start difference. First operand 288 states and 395 transitions. Second operand has 10 states, 7 states have (on average 7.428571428571429) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 15:19:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:02,892 INFO L93 Difference]: Finished difference Result 671 states and 917 transitions. [2025-01-09 15:19:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:19:02,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 7.428571428571429) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2025-01-09 15:19:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:02,901 INFO L225 Difference]: With dead ends: 671 [2025-01-09 15:19:02,901 INFO L226 Difference]: Without dead ends: 386 [2025-01-09 15:19:02,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:19:02,904 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 92 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:02,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1196 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:19:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-01-09 15:19:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 261. [2025-01-09 15:19:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 217 states have (on average 1.2857142857142858) internal successors, (279), 219 states have internal predecessors, (279), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 15:19:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2025-01-09 15:19:02,948 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 134 [2025-01-09 15:19:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:02,949 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2025-01-09 15:19:02,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 7.428571428571429) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 15:19:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2025-01-09 15:19:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:19:02,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:02,954 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:02,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:19:02,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:02,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash -432013072, now seen corresponding path program 1 times [2025-01-09 15:19:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:02,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588034144] [2025-01-09 15:19:02,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:02,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:19:03,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:19:03,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:03,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:19:03,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:03,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588034144] [2025-01-09 15:19:03,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588034144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:03,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:03,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:19:03,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442910441] [2025-01-09 15:19:03,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:03,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:19:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:03,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:19:03,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:19:03,422 INFO L87 Difference]: Start difference. First operand 261 states and 357 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:19:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:03,954 INFO L93 Difference]: Finished difference Result 672 states and 913 transitions. [2025-01-09 15:19:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:19:03,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-01-09 15:19:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:03,958 INFO L225 Difference]: With dead ends: 672 [2025-01-09 15:19:03,958 INFO L226 Difference]: Without dead ends: 410 [2025-01-09 15:19:03,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:19:03,959 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 97 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:03,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1090 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:19:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-01-09 15:19:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 215. [2025-01-09 15:19:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 180 states have (on average 1.2833333333333334) internal successors, (231), 181 states have internal predecessors, (231), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:19:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 291 transitions. [2025-01-09 15:19:03,991 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 291 transitions. Word has length 134 [2025-01-09 15:19:03,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:03,991 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 291 transitions. [2025-01-09 15:19:03,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:19:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 291 transitions. [2025-01-09 15:19:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:19:03,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:03,993 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:03,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:19:03,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:03,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:03,994 INFO L85 PathProgramCache]: Analyzing trace with hash -832680014, now seen corresponding path program 1 times [2025-01-09 15:19:03,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:03,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576993489] [2025-01-09 15:19:03,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:04,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:19:04,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:19:04,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:04,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:19:04,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:04,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576993489] [2025-01-09 15:19:04,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576993489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:04,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601785786] [2025-01-09 15:19:04,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:04,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:19:04,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:19:04,539 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 15:19:04,542 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 15:19:04,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:19:04,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:19:04,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:04,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:04,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:19:04,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:04,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 15:19:04,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 15:19:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 132 proven. 42 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-09 15:19:05,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:19:05,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601785786] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:19:05,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:19:05,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-01-09 15:19:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061882304] [2025-01-09 15:19:05,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:19:05,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:19:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:05,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:19:05,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:19:05,268 INFO L87 Difference]: Start difference. First operand 215 states and 291 transitions. Second operand has 15 states, 12 states have (on average 8.416666666666666) internal successors, (101), 15 states have internal predecessors, (101), 7 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (49), 4 states have call predecessors, (49), 7 states have call successors, (49) [2025-01-09 15:19:05,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:05,819 INFO L93 Difference]: Finished difference Result 443 states and 593 transitions. [2025-01-09 15:19:05,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:19:05,819 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.416666666666666) internal successors, (101), 15 states have internal predecessors, (101), 7 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (49), 4 states have call predecessors, (49), 7 states have call successors, (49) Word has length 135 [2025-01-09 15:19:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:05,821 INFO L225 Difference]: With dead ends: 443 [2025-01-09 15:19:05,821 INFO L226 Difference]: Without dead ends: 231 [2025-01-09 15:19:05,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 263 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:19:05,825 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 93 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:05,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 493 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:19:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-01-09 15:19:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 223. [2025-01-09 15:19:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 186 states have (on average 1.2634408602150538) internal successors, (235), 187 states have internal predecessors, (235), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:19:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 295 transitions. [2025-01-09 15:19:05,854 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 295 transitions. Word has length 135 [2025-01-09 15:19:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:05,855 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 295 transitions. [2025-01-09 15:19:05,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.416666666666666) internal successors, (101), 15 states have internal predecessors, (101), 7 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (49), 4 states have call predecessors, (49), 7 states have call successors, (49) [2025-01-09 15:19:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 295 transitions. [2025-01-09 15:19:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:19:05,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:05,857 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:05,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:19:06,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:19:06,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:06,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1419486028, now seen corresponding path program 1 times [2025-01-09 15:19:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:06,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115407971] [2025-01-09 15:19:06,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:06,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:06,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:19:06,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:19:06,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:06,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:19:06,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263514494] [2025-01-09 15:19:06,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:06,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:19:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:19:06,174 INFO L229 MonitoredProcess]: Starting monitored process 5 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 15:19:06,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:19:06,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:19:06,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:19:06,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:06,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:06,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-01-09 15:19:06,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:06,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 15:19:06,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 15:19:06,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 15:19:06,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:19:06,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 15:19:07,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 15:19:07,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 15:19:08,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2025-01-09 15:19:08,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2025-01-09 15:19:08,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:19:08,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 90 [2025-01-09 15:19:10,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:19:10,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 83 [2025-01-09 15:19:27,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:19:27,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 85 [2025-01-09 15:19:27,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 15:19:27,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:19:27,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 41 [2025-01-09 15:19:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 406 proven. 66 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 15:19:28,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:56,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:56,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115407971] [2025-01-09 15:19:56,717 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:19:56,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263514494] [2025-01-09 15:19:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263514494] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:56,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:19:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2025-01-09 15:19:56,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902402782] [2025-01-09 15:19:56,717 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 15:19:56,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 15:19:56,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:56,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 15:19:56,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=2786, Unknown=9, NotChecked=0, Total=3192 [2025-01-09 15:19:56,720 INFO L87 Difference]: Start difference. First operand 223 states and 295 transitions. Second operand has 35 states, 30 states have (on average 2.566666666666667) internal successors, (77), 33 states have internal predecessors, (77), 9 states have call successors, (17), 5 states have call predecessors, (17), 9 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2025-01-09 15:20:23,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]