./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-sp_file-92.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 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:10:07,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:10:07,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:10:07,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:10:07,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:10:07,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:10:07,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:10:07,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:10:07,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:10:07,809 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:10:07,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:10:07,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:10:07,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:10:07,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:10:07,810 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:10:07,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:10:07,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:10:07,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:10:07,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:10:07,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:10:07,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:10:07,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:10:07,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:10:07,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:10:07,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:10:07,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:10:07,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:10:07,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:10:07,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:10:07,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:10:07,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:10:07,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:10:07,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:10:07,812 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 -> 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 [2025-02-06 04:10:08,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:10:08,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:10:08,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:10:08,219 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:10:08,219 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:10:08,220 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-sp_file-92.i [2025-02-06 04:10:09,456 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/659921db1/f610f89e09ee4f109a9e72fb6fd01886/FLAG3d7844064 [2025-02-06 04:10:09,750 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:10:09,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i [2025-02-06 04:10:09,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/659921db1/f610f89e09ee4f109a9e72fb6fd01886/FLAG3d7844064 [2025-02-06 04:10:10,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/659921db1/f610f89e09ee4f109a9e72fb6fd01886 [2025-02-06 04:10:10,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:10:10,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:10:10,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:10:10,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:10:10,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:10:10,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a707027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10, skipping insertion in model container [2025-02-06 04:10:10,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:10:10,156 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-sp_file-92.i[917,930] [2025-02-06 04:10:10,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:10:10,198 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:10:10,210 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-sp_file-92.i[917,930] [2025-02-06 04:10:10,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:10:10,250 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:10:10,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10 WrapperNode [2025-02-06 04:10:10,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:10:10,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:10:10,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:10:10,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:10:10,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,287 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2025-02-06 04:10:10,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:10:10,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:10:10,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:10:10,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:10:10,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,301 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:10:10,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:10:10,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:10:10,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:10:10,316 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:10:10,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:10:10,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:10,344 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-02-06 04:10:10,350 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-02-06 04:10:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:10:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:10:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:10:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:10:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:10:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:10:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:10:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:10:10,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:10:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:10:10,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:10:10,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:10:10,475 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:10:10,476 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:10:11,007 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~mem86#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~bitwise90#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~short97#1;havoc property_#t~mem102#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~short111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite120#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1; [2025-02-06 04:10:11,045 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-02-06 04:10:11,045 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:10:11,058 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:10:11,058 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:10:11,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:10:11 BoogieIcfgContainer [2025-02-06 04:10:11,058 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:10:11,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:10:11,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:10:11,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:10:11,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:10:10" (1/3) ... [2025-02-06 04:10:11,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c593751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:10:11, skipping insertion in model container [2025-02-06 04:10:11,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (2/3) ... [2025-02-06 04:10:11,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c593751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:10:11, skipping insertion in model container [2025-02-06 04:10:11,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:10:11" (3/3) ... [2025-02-06 04:10:11,065 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-92.i [2025-02-06 04:10:11,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:10:11,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-92.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:10:11,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:10:11,117 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;@289b0f81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:10:11,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:10:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 91 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 04:10:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 04:10:11,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:11,128 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:10:11,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:11,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash -852200891, now seen corresponding path program 1 times [2025-02-06 04:10:11,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:11,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-02-06 04:10:11,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:11,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:11,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:11,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:11,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:11,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 04:10:11,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:11,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-02-06 04:10:11,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296084512] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445851454] [2025-02-06 04:10:11,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:11,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:11,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:11,442 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-02-06 04:10:11,446 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-02-06 04:10:11,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:11,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:11,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:11,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:11,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:10:11,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 04:10:11,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445851454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:11,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:10:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:10:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838936418] [2025-02-06 04:10:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:11,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:10:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:11,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:10:11,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:10:11,711 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 91 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 04:10:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:11,738 INFO L93 Difference]: Finished difference Result 218 states and 336 transitions. [2025-02-06 04:10:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:10:11,740 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-02-06 04:10:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:11,745 INFO L225 Difference]: With dead ends: 218 [2025-02-06 04:10:11,745 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 04:10:11,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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-02-06 04:10:11,749 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:11,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:10:11,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 04:10:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-06 04:10:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 04:10:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-02-06 04:10:11,799 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2025-02-06 04:10:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:11,799 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-02-06 04:10:11,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 04:10:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-02-06 04:10:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 04:10:11,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:11,802 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:10:11,810 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-02-06 04:10:12,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-02-06 04:10:12,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:12,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash -344180876, now seen corresponding path program 1 times [2025-02-06 04:10:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:12,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334690166] [2025-02-06 04:10:12,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:12,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:12,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:12,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:12,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 04:10:12,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:12,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334690166] [2025-02-06 04:10:12,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334690166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:12,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:12,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:10:12,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911418728] [2025-02-06 04:10:12,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:12,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:10:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:12,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:10:12,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:10:12,346 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 04:10:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:12,388 INFO L93 Difference]: Finished difference Result 218 states and 313 transitions. [2025-02-06 04:10:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:10:12,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-02-06 04:10:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:12,392 INFO L225 Difference]: With dead ends: 218 [2025-02-06 04:10:12,393 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 04:10:12,394 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-02-06 04:10:12,395 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:12,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:10:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 04:10:12,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-02-06 04:10:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 04:10:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-02-06 04:10:12,428 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 153 [2025-02-06 04:10:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:12,429 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-02-06 04:10:12,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 04:10:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-02-06 04:10:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 04:10:12,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:12,433 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:10:12,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:10:12,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:12,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:12,435 INFO L85 PathProgramCache]: Analyzing trace with hash -343257355, now seen corresponding path program 1 times [2025-02-06 04:10:12,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:12,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875204649] [2025-02-06 04:10:12,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:12,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:12,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:12,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:12,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:12,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 04:10:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875204649] [2025-02-06 04:10:14,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875204649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538492570] [2025-02-06 04:10:14,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:14,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:14,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:14,935 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-02-06 04:10:14,937 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-02-06 04:10:15,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:15,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:15,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:15,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:15,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 04:10:15,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:15,299 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-02-06 04:10:15,664 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 23 treesize of output 11 [2025-02-06 04:10:15,905 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 23 treesize of output 11 [2025-02-06 04:10:16,129 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 23 treesize of output 11 [2025-02-06 04:10:16,363 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 23 treesize of output 11 [2025-02-06 04:10:16,580 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 23 treesize of output 11 [2025-02-06 04:10:16,750 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 23 treesize of output 11 [2025-02-06 04:10:16,914 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 23 treesize of output 11 [2025-02-06 04:10:17,249 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 23 treesize of output 11 [2025-02-06 04:10:17,442 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 23 treesize of output 11 [2025-02-06 04:10:17,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:17,636 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 23 treesize of output 11 [2025-02-06 04:10:17,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:17,676 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 23 treesize of output 11 [2025-02-06 04:10:17,697 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-02-06 04:10:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 16 proven. 184 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-06 04:10:17,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:10:17,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_562) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 1)) (not (= v_ArrVal_562 (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_562 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))))) is different from false [2025-02-06 04:10:17,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_561)))) (or (< 0 (+ (select (select (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_562) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 1)) (not (= v_ArrVal_562 (store (select .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_562 c_~WrapperStruct00_var_1_7_Pointer~0.offset))))))) is different from false [2025-02-06 04:10:17,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538492570] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:17,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:10:17,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2025-02-06 04:10:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311365379] [2025-02-06 04:10:17,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:10:17,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 04:10:17,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:17,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 04:10:17,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=276, Unknown=2, NotChecked=70, Total=420 [2025-02-06 04:10:17,786 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 19 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 7 states have call successors, (38) [2025-02-06 04:10:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:18,573 INFO L93 Difference]: Finished difference Result 227 states and 320 transitions. [2025-02-06 04:10:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:10:18,573 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 7 states have call successors, (38) Word has length 153 [2025-02-06 04:10:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:18,575 INFO L225 Difference]: With dead ends: 227 [2025-02-06 04:10:18,575 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 04:10:18,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=413, Unknown=2, NotChecked=90, Total=650 [2025-02-06 04:10:18,580 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 245 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:18,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 622 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:10:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 04:10:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2025-02-06 04:10:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 04:10:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2025-02-06 04:10:18,594 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 153 [2025-02-06 04:10:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:18,595 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2025-02-06 04:10:18,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 7 states have call successors, (38) [2025-02-06 04:10:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2025-02-06 04:10:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 04:10:18,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:18,600 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:10:18,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:10:18,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:18,801 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:18,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:18,802 INFO L85 PathProgramCache]: Analyzing trace with hash -131906442, now seen corresponding path program 1 times [2025-02-06 04:10:18,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:18,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563526357] [2025-02-06 04:10:18,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:18,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:18,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:19,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:19,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:19,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 04:10:25,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:25,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563526357] [2025-02-06 04:10:25,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563526357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:25,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:25,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 04:10:25,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336572023] [2025-02-06 04:10:25,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:25,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:10:25,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:25,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:10:25,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:10:25,687 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 04:10:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:28,033 INFO L93 Difference]: Finished difference Result 321 states and 447 transitions. [2025-02-06 04:10:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:10:28,034 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-02-06 04:10:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:28,039 INFO L225 Difference]: With dead ends: 321 [2025-02-06 04:10:28,039 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 04:10:28,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-02-06 04:10:28,040 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 800 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:28,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 581 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 04:10:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 04:10:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 133. [2025-02-06 04:10:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3243243243243243) internal successors, (147), 111 states have internal predecessors, (147), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 04:10:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2025-02-06 04:10:28,071 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 153 [2025-02-06 04:10:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:28,071 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2025-02-06 04:10:28,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 04:10:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2025-02-06 04:10:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 04:10:28,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:28,075 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:10:28,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:10:28,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:28,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1375645367, now seen corresponding path program 1 times [2025-02-06 04:10:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355601099] [2025-02-06 04:10:28,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:28,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:28,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:28,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:28,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 04:10:31,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:31,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355601099] [2025-02-06 04:10:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355601099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:31,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:31,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:10:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303704103] [2025-02-06 04:10:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:31,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:10:31,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:31,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:10:31,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:31,399 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 04:10:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:32,714 INFO L93 Difference]: Finished difference Result 315 states and 434 transitions. [2025-02-06 04:10:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:32,715 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-02-06 04:10:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:32,716 INFO L225 Difference]: With dead ends: 315 [2025-02-06 04:10:32,716 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 04:10:32,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:10:32,717 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 276 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:32,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 569 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 04:10:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 04:10:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2025-02-06 04:10:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 152 states have (on average 1.3157894736842106) internal successors, (200), 153 states have internal predecessors, (200), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 04:10:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 246 transitions. [2025-02-06 04:10:32,753 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 246 transitions. Word has length 153 [2025-02-06 04:10:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:32,753 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 246 transitions. [2025-02-06 04:10:32,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 04:10:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 246 transitions. [2025-02-06 04:10:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 04:10:32,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:32,756 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:10:32,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:10:32,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:32,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash 829707575, now seen corresponding path program 1 times [2025-02-06 04:10:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:32,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688139013] [2025-02-06 04:10:32,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:32,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:32,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:32,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:32,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:32,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 04:10:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688139013] [2025-02-06 04:10:36,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688139013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:36,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:36,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:10:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211650683] [2025-02-06 04:10:36,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:36,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:10:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:36,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:10:36,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:36,002 INFO L87 Difference]: Start difference. First operand 180 states and 246 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 04:10:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:37,079 INFO L93 Difference]: Finished difference Result 413 states and 562 transitions. [2025-02-06 04:10:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:37,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-02-06 04:10:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:37,083 INFO L225 Difference]: With dead ends: 413 [2025-02-06 04:10:37,083 INFO L226 Difference]: Without dead ends: 236 [2025-02-06 04:10:37,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:10:37,085 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 286 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:37,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 552 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 04:10:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-06 04:10:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 184. [2025-02-06 04:10:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 156 states have (on average 1.314102564102564) internal successors, (205), 157 states have internal predecessors, (205), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 04:10:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 251 transitions. [2025-02-06 04:10:37,117 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 251 transitions. Word has length 153 [2025-02-06 04:10:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:37,117 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 251 transitions. [2025-02-06 04:10:37,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 04:10:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 251 transitions. [2025-02-06 04:10:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 04:10:37,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:37,119 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:10:37,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:10:37,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:37,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1957707912, now seen corresponding path program 1 times [2025-02-06 04:10:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:37,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762133460] [2025-02-06 04:10:37,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:37,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:37,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:37,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:37,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 04:10:45,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:45,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762133460] [2025-02-06 04:10:45,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762133460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:45,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:45,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 04:10:45,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474333523] [2025-02-06 04:10:45,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:45,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 04:10:45,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:45,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 04:10:45,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:10:45,006 INFO L87 Difference]: Start difference. First operand 184 states and 251 transitions. Second operand has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 04:10:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:48,767 INFO L93 Difference]: Finished difference Result 401 states and 548 transitions. [2025-02-06 04:10:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:10:48,767 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-02-06 04:10:48,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:48,769 INFO L225 Difference]: With dead ends: 401 [2025-02-06 04:10:48,769 INFO L226 Difference]: Without dead ends: 220 [2025-02-06 04:10:48,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2025-02-06 04:10:48,770 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 458 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:48,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 950 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 04:10:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-06 04:10:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 182. [2025-02-06 04:10:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.3116883116883118) internal successors, (202), 155 states have internal predecessors, (202), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 04:10:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2025-02-06 04:10:48,824 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 153 [2025-02-06 04:10:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:48,825 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2025-02-06 04:10:48,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 04:10:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2025-02-06 04:10:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 04:10:48,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:48,828 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:10:48,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:10:48,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:48,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash 404678548, now seen corresponding path program 1 times [2025-02-06 04:10:48,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:48,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501556611] [2025-02-06 04:10:48,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:48,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 04:10:48,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 04:10:48,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:48,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 04:10:50,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:50,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501556611] [2025-02-06 04:10:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501556611] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957928286] [2025-02-06 04:10:50,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:50,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:50,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:50,376 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-02-06 04:10:50,377 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-02-06 04:10:50,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 04:10:50,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 04:10:50,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:50,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:50,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-06 04:10:50,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:52,460 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-02-06 04:10:53,265 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 23 treesize of output 11 [2025-02-06 04:10:53,857 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 23 treesize of output 11 [2025-02-06 04:10:54,256 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 23 treesize of output 11 [2025-02-06 04:10:54,719 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 23 treesize of output 11 [2025-02-06 04:10:55,511 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 23 treesize of output 11 [2025-02-06 04:10:56,098 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 23 treesize of output 11 [2025-02-06 04:10:56,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:56,677 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 23 treesize of output 11 [2025-02-06 04:10:56,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:56,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:56,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:56,957 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 30 treesize of output 21 [2025-02-06 04:10:57,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,118 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 30 treesize of output 21 [2025-02-06 04:10:57,204 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-02-06 04:10:57,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 62 [2025-02-06 04:10:57,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 73 [2025-02-06 04:10:57,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2025-02-06 04:10:57,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,374 INFO L349 Elim1Store]: treesize reduction 90, result has 23.1 percent of original size [2025-02-06 04:10:57,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 95 [2025-02-06 04:10:57,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,431 INFO L349 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2025-02-06 04:10:57,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 95 [2025-02-06 04:10:57,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:57,808 INFO L349 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2025-02-06 04:10:57,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 72 [2025-02-06 04:10:58,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:58,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:58,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:58,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:58,096 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-02-06 04:10:58,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2025-02-06 04:10:58,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:58,164 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-02-06 04:10:58,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 31 [2025-02-06 04:10:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 268 proven. 166 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-06 04:10:58,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:11:27,845 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem13#1| Int)) (< 0 (+ |c_ULTIMATE.start_step_#t~bitwise16#1| (select (select |c_#memory_int| c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (* |ULTIMATE.start_step_#t~mem13#1| |c_ULTIMATE.start_step_#t~bitwise16#1|)))) (let ((.cse0 (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((v_ArrVal_1238 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_1238 c_~WrapperStruct00_var_1_7_Pointer~0.offset)) v_ArrVal_1238)) (forall ((v_ArrVal_1239 Int)) (let ((.cse4 (let ((.cse5 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_1238))) (store .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1239))))) (or (forall ((v_ArrVal_1244 Int) (v_ArrVal_1243 Int)) (let ((.cse1 (let ((.cse3 (store .cse4 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_1243))))) (or (< (select (select .cse1 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2) (let ((.cse2 (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1244)))) (< (select (select .cse2 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (+ (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) (select (select .cse2 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 1)))))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (= (mod (select (select .cse4 ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))))) (forall ((v_ArrVal_1238 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_1238 c_~WrapperStruct00_var_1_7_Pointer~0.offset)) v_ArrVal_1238)) (forall ((v_ArrVal_1239 Int)) (let ((.cse9 (let ((.cse10 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_1238))) (store .cse10 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1239))))) (or (forall ((v_ArrVal_1244 Int) (v_ArrVal_1243 Int)) (let ((.cse7 (let ((.cse8 (store .cse9 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse8 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_1243))))) (or (let ((.cse6 (store .cse7 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse7 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1244)))) (< (select (select .cse6 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (+ (select (select .cse6 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) (select (select .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 1))) (< (select (select .cse7 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2)))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (not (= (mod (select (select .cse9 ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))))))))) is different from false [2025-02-06 04:11:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957928286] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:11:33,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:11:33,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 31 [2025-02-06 04:11:33,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932743786] [2025-02-06 04:11:33,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:11:33,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 04:11:33,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:33,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 04:11:33,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1574, Unknown=6, NotChecked=80, Total=1806 [2025-02-06 04:11:33,311 INFO L87 Difference]: Start difference. First operand 182 states and 248 transitions. Second operand has 31 states, 29 states have (on average 4.275862068965517) internal successors, (124), 30 states have internal predecessors, (124), 8 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38)