./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c6dac1e5238ed53a380160bb79ff5b6b2442b7be93876c5524c1d6a035c6da2a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:57:15,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:57:15,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:57:15,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:57:15,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:57:15,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:57:15,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:57:15,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:57:15,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:57:15,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:57:15,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:57:15,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:57:15,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:57:15,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:57:15,351 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:57:15,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:57:15,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:57:15,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:57:15,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:57:15,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:57:15,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:57:15,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:57:15,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:57:15,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:57:15,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:57:15,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:57:15,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:57:15,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:57:15,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:57:15,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:57:15,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:57:15,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:57:15,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:57:15,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:57:15,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:57:15,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:57:15,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:57:15,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:57:15,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:57:15,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:57:15,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:57:15,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:57:15,362 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> c6dac1e5238ed53a380160bb79ff5b6b2442b7be93876c5524c1d6a035c6da2a [2024-11-16 18:57:15,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:57:15,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:57:15,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:57:15,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:57:15,691 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:57:15,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2024-11-16 18:57:17,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:57:17,312 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:57:17,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2024-11-16 18:57:17,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c4154e3/0c2bf0b85b9b46da9410da16ac1f2380/FLAGbfa7f518e [2024-11-16 18:57:17,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c4154e3/0c2bf0b85b9b46da9410da16ac1f2380 [2024-11-16 18:57:17,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:57:17,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:57:17,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:57:17,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:57:17,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:57:17,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b6b18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17, skipping insertion in model container [2024-11-16 18:57:17,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:57:17,549 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i[917,930] [2024-11-16 18:57:17,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:57:17,653 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:57:17,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i[917,930] [2024-11-16 18:57:17,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:57:17,745 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:57:17,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17 WrapperNode [2024-11-16 18:57:17,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:57:17,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:57:17,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:57:17,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:57:17,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,871 INFO L138 Inliner]: procedures = 30, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 523 [2024-11-16 18:57:17,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:57:17,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:57:17,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:57:17,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:57:17,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,902 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-16 18:57:17,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:57:17,948 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:57:17,948 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:57:17,948 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:57:17,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (1/1) ... [2024-11-16 18:57:17,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:57:17,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:57:17,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:57:18,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:57:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:57:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-16 18:57:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-16 18:57:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-16 18:57:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 18:57:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-16 18:57:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 18:57:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:57:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:57:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 18:57:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:57:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:57:18,197 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:57:18,199 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:57:18,963 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite97#1;havoc property_#t~mem89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~short88#1;havoc property_#t~mem90#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~mem103#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite123#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem128#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~short129#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1;havoc property_#t~mem140#1;havoc property_#t~short141#1; [2024-11-16 18:57:19,038 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-11-16 18:57:19,038 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:57:19,054 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:57:19,055 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:57:19,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:19 BoogieIcfgContainer [2024-11-16 18:57:19,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:57:19,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:57:19,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:57:19,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:57:19,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:57:17" (1/3) ... [2024-11-16 18:57:19,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcdffd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:19, skipping insertion in model container [2024-11-16 18:57:19,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:17" (2/3) ... [2024-11-16 18:57:19,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcdffd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:19, skipping insertion in model container [2024-11-16 18:57:19,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:19" (3/3) ... [2024-11-16 18:57:19,065 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-61.i [2024-11-16 18:57:19,083 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:57:19,083 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:57:19,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:57:19,165 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;@441ca1a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:57:19,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:57:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 96 states have internal predecessors, (128), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 18:57:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 18:57:19,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:19,188 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:19,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:19,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:19,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2013243677, now seen corresponding path program 1 times [2024-11-16 18:57:19,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:19,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269696778] [2024-11-16 18:57:19,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:19,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:57:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 18:57:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 18:57:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 18:57:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 18:57:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 18:57:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 18:57:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 18:57:19,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:19,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269696778] [2024-11-16 18:57:19,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269696778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:19,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:19,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:57:19,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162564124] [2024-11-16 18:57:19,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:19,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:57:19,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:19,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:57:19,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:57:19,942 INFO L87 Difference]: Start difference. First operand has 123 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 96 states have internal predecessors, (128), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 18:57:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:19,977 INFO L93 Difference]: Finished difference Result 238 states and 374 transitions. [2024-11-16 18:57:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:57:19,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 192 [2024-11-16 18:57:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:19,987 INFO L225 Difference]: With dead ends: 238 [2024-11-16 18:57:19,987 INFO L226 Difference]: Without dead ends: 118 [2024-11-16 18:57:19,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:57:19,995 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:19,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:57:20,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-16 18:57:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-16 18:57:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 18:57:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-11-16 18:57:20,043 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 192 [2024-11-16 18:57:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:20,043 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-11-16 18:57:20,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 18:57:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-11-16 18:57:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 18:57:20,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:20,048 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:20,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:57:20,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:20,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash 730071686, now seen corresponding path program 1 times [2024-11-16 18:57:20,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:20,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980164898] [2024-11-16 18:57:20,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:57:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 18:57:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 18:57:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 18:57:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 18:57:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 18:57:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 18:57:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 18:57:20,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980164898] [2024-11-16 18:57:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980164898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:20,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:20,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:57:20,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416267783] [2024-11-16 18:57:20,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:20,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:57:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:20,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:57:20,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:57:20,653 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-16 18:57:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:20,724 INFO L93 Difference]: Finished difference Result 236 states and 341 transitions. [2024-11-16 18:57:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:57:20,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2024-11-16 18:57:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:20,729 INFO L225 Difference]: With dead ends: 236 [2024-11-16 18:57:20,731 INFO L226 Difference]: Without dead ends: 121 [2024-11-16 18:57:20,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:57:20,736 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:20,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 490 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:57:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-16 18:57:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-16 18:57:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 18:57:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2024-11-16 18:57:20,764 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 192 [2024-11-16 18:57:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:20,766 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2024-11-16 18:57:20,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-16 18:57:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2024-11-16 18:57:20,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 18:57:20,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:20,774 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:20,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:57:20,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:20,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash 533558181, now seen corresponding path program 1 times [2024-11-16 18:57:20,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:20,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061469082] [2024-11-16 18:57:20,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:20,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:57:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 18:57:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 18:57:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 18:57:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 18:57:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 18:57:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 18:57:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 18:57:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:21,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061469082] [2024-11-16 18:57:21,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061469082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:21,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:21,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:57:21,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156903754] [2024-11-16 18:57:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:21,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:57:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:57:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:57:21,153 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-16 18:57:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:21,193 INFO L93 Difference]: Finished difference Result 240 states and 345 transitions. [2024-11-16 18:57:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:57:21,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2024-11-16 18:57:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:21,196 INFO L225 Difference]: With dead ends: 240 [2024-11-16 18:57:21,196 INFO L226 Difference]: Without dead ends: 123 [2024-11-16 18:57:21,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:57:21,197 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:21,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 491 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:57:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-16 18:57:21,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-16 18:57:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 18:57:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2024-11-16 18:57:21,208 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 192 [2024-11-16 18:57:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:21,208 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2024-11-16 18:57:21,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-16 18:57:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2024-11-16 18:57:21,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 18:57:21,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:21,211 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:21,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:57:21,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:21,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:21,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2018598780, now seen corresponding path program 1 times [2024-11-16 18:57:21,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:21,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985021523] [2024-11-16 18:57:21,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:21,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:57:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 18:57:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 18:57:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 18:57:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 18:57:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 18:57:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 18:57:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-16 18:57:24,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:24,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985021523] [2024-11-16 18:57:24,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985021523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:57:24,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444937155] [2024-11-16 18:57:24,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:57:24,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:57:24,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:57:24,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:57:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:24,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-16 18:57:24,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:57:25,303 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 [2024-11-16 18:57:26,384 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 [2024-11-16 18:57:27,787 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 25 treesize of output 13 [2024-11-16 18:57:28,951 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 25 treesize of output 13 [2024-11-16 18:57:29,933 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 25 treesize of output 13 [2024-11-16 18:57:30,752 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 25 treesize of output 13 [2024-11-16 18:57:31,534 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 25 treesize of output 13 [2024-11-16 18:57:32,305 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 25 treesize of output 13 [2024-11-16 18:57:32,955 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 25 treesize of output 13 [2024-11-16 18:57:33,761 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 25 treesize of output 13 [2024-11-16 18:57:34,522 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 25 treesize of output 13 [2024-11-16 18:57:35,277 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 25 treesize of output 13 [2024-11-16 18:57:36,004 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 25 treesize of output 13 [2024-11-16 18:57:36,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:36,651 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 25 treesize of output 13 [2024-11-16 18:57:37,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:37,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:37,316 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 70 treesize of output 53 [2024-11-16 18:57:37,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2024-11-16 18:57:37,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:37,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:37,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:37,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:37,526 INFO L349 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2024-11-16 18:57:37,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 117 [2024-11-16 18:57:37,926 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-11-16 18:57:37,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 44 treesize of output 27 [2024-11-16 18:57:37,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2024-11-16 18:57:37,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:37,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:37,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:37,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,002 INFO L349 Elim1Store]: treesize reduction 148, result has 0.7 percent of original size [2024-11-16 18:57:38,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 83 [2024-11-16 18:57:38,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2024-11-16 18:57:38,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,056 INFO L349 Elim1Store]: treesize reduction 202, result has 0.5 percent of original size [2024-11-16 18:57:38,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 106 [2024-11-16 18:57:38,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,178 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 35 treesize of output 33 [2024-11-16 18:57:38,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:57:38,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2024-11-16 18:57:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 269 proven. 156 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-16 18:57:38,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:57:38,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_18_Pointer~0.offset Int) (v_ArrVal_728 Int) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_734 Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| c_~WrapperStruct00_var_1_20_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset v_ArrVal_728)))) (store .cse3 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (mod (select (select .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.base) ~WrapperStruct00_var_1_18_Pointer~0.offset) 256)))))) (or (not (= (mod (select (select (let ((.cse0 (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_729))) (store .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_734))) c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_729 (store (select .cse2 c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_729 c_~WrapperStruct00_var_1_23_Pointer~0.offset))))))) is different from false [2024-11-16 18:57:39,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base))) (and (forall ((v_ArrVal_728 Int) (~WrapperStruct00_var_1_18_Pointer~0.offset Int) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_725 Int) (v_ArrVal_724 Int) (v_ArrVal_734 Int)) (let ((.cse3 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_724)))) (let ((.cse0 (let ((.cse4 (let ((.cse5 (store .cse3 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset v_ArrVal_725)))) (store .cse5 c_~WrapperStruct00_var_1_20_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset v_ArrVal_728))))) (store .cse4 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (mod (select (select .cse4 c_~WrapperStruct00_var_1_18_Pointer~0.base) ~WrapperStruct00_var_1_18_Pointer~0.offset) 256)))))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_729 c_~WrapperStruct00_var_1_23_Pointer~0.offset)) v_ArrVal_729)) (not (= (mod (select (select (let ((.cse1 (let ((.cse2 (store .cse0 c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_729))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse1 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_734))) c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256) 0)) (= (mod (select (select .cse3 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0))))) (forall ((v_ArrVal_728 Int) (~WrapperStruct00_var_1_18_Pointer~0.offset Int) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_725 Int) (v_ArrVal_724 Int) (v_ArrVal_734 Int)) (let ((.cse10 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_724)))) (let ((.cse7 (let ((.cse11 (let ((.cse12 (store .cse10 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset v_ArrVal_725)))) (store .cse12 c_~WrapperStruct00_var_1_20_Pointer~0.base (store (select .cse12 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset v_ArrVal_728))))) (store .cse11 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (mod (select (select .cse11 c_~WrapperStruct00_var_1_18_Pointer~0.base) ~WrapperStruct00_var_1_18_Pointer~0.offset) 256)))))) (or (not (= (store (select .cse7 c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_729 c_~WrapperStruct00_var_1_23_Pointer~0.offset)) v_ArrVal_729)) (not (= (mod (select (select (let ((.cse8 (let ((.cse9 (store .cse7 c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_729))) (store .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select .cse9 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse8 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_734))) c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256) 0)) (= (mod (select (select .cse10 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256) 0))))))) is different from false [2024-11-16 18:57:39,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444937155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:57:39,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:57:39,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 24 [2024-11-16 18:57:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215077719] [2024-11-16 18:57:39,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:57:39,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-16 18:57:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-16 18:57:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=837, Unknown=3, NotChecked=118, Total=1056 [2024-11-16 18:57:39,483 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 24 states, 21 states have (on average 6.380952380952381) internal successors, (134), 24 states have internal predecessors, (134), 9 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 9 states have call successors, (50) [2024-11-16 18:57:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:45,185 INFO L93 Difference]: Finished difference Result 373 states and 518 transitions. [2024-11-16 18:57:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 18:57:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.380952380952381) internal successors, (134), 24 states have internal predecessors, (134), 9 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 9 states have call successors, (50) Word has length 192 [2024-11-16 18:57:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:45,191 INFO L225 Difference]: With dead ends: 373 [2024-11-16 18:57:45,191 INFO L226 Difference]: Without dead ends: 254 [2024-11-16 18:57:45,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=514, Invalid=3031, Unknown=3, NotChecked=234, Total=3782 [2024-11-16 18:57:45,194 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1457 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 201 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:45,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 772 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 2037 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2024-11-16 18:57:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-16 18:57:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 147. [2024-11-16 18:57:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 116 states have (on average 1.293103448275862) internal successors, (150), 117 states have internal predecessors, (150), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:57:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 204 transitions. [2024-11-16 18:57:45,218 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 204 transitions. Word has length 192 [2024-11-16 18:57:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:45,219 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 204 transitions. [2024-11-16 18:57:45,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.380952380952381) internal successors, (134), 24 states have internal predecessors, (134), 9 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 9 states have call successors, (50) [2024-11-16 18:57:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 204 transitions. [2024-11-16 18:57:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 18:57:45,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:45,222 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:45,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:57:45,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:57:45,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:45,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash -699817945, now seen corresponding path program 1 times [2024-11-16 18:57:45,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:45,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916280866] [2024-11-16 18:57:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:45,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:57:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 18:57:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 18:57:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 18:57:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 18:57:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 18:57:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 18:57:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 18:57:47,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:47,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916280866] [2024-11-16 18:57:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916280866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:47,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:47,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:57:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294309788] [2024-11-16 18:57:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:47,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:57:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:57:47,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:57:47,723 INFO L87 Difference]: Start difference. First operand 147 states and 204 transitions. Second operand has 10 states, 8 states have (on average 9.0) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-16 18:57:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:48,922 INFO L93 Difference]: Finished difference Result 275 states and 381 transitions. [2024-11-16 18:57:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:57:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.0) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 194 [2024-11-16 18:57:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:48,926 INFO L225 Difference]: With dead ends: 275 [2024-11-16 18:57:48,926 INFO L226 Difference]: Without dead ends: 137 [2024-11-16 18:57:48,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:57:48,927 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 119 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:48,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 532 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 18:57:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-16 18:57:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-16 18:57:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 105 states have (on average 1.2571428571428571) internal successors, (132), 106 states have internal predecessors, (132), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:57:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 186 transitions. [2024-11-16 18:57:48,957 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 186 transitions. Word has length 194 [2024-11-16 18:57:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:48,958 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 186 transitions. [2024-11-16 18:57:48,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.0) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-16 18:57:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 186 transitions. [2024-11-16 18:57:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 18:57:48,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:48,960 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:48,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:57:48,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:48,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash 155970053, now seen corresponding path program 1 times [2024-11-16 18:57:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:48,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127751814] [2024-11-16 18:57:48,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:48,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:57:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 18:57:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 18:57:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 18:57:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 18:57:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 18:57:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 18:57:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-16 18:57:54,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127751814] [2024-11-16 18:57:54,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127751814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:57:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254835698] [2024-11-16 18:57:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:54,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:57:54,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:57:54,840 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:57:54,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 18:57:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:55,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-16 18:57:55,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:57:56,683 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 [2024-11-16 18:57:57,666 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 25 treesize of output 13 [2024-11-16 18:57:58,290 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 25 treesize of output 13 [2024-11-16 18:57:58,915 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 25 treesize of output 13 [2024-11-16 18:57:59,610 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 25 treesize of output 13 [2024-11-16 18:58:00,183 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 25 treesize of output 13 [2024-11-16 18:58:00,809 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 25 treesize of output 13 [2024-11-16 18:58:01,446 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 25 treesize of output 13 [2024-11-16 18:58:02,002 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 25 treesize of output 13 [2024-11-16 18:58:02,608 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 25 treesize of output 13 [2024-11-16 18:58:03,149 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 25 treesize of output 13 [2024-11-16 18:58:03,709 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 25 treesize of output 13 [2024-11-16 18:58:04,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:04,255 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 25 treesize of output 13 [2024-11-16 18:58:04,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:04,451 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 25 treesize of output 13 [2024-11-16 18:58:04,564 INFO L349 Elim1Store]: treesize reduction 57, result has 24.0 percent of original size [2024-11-16 18:58:04,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 95 [2024-11-16 18:58:04,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:04,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:04,607 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 18:58:04,684 INFO L349 Elim1Store]: treesize reduction 169, result has 23.5 percent of original size [2024-11-16 18:58:04,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 155 [2024-11-16 18:58:05,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:05,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:05,360 INFO L349 Elim1Store]: treesize reduction 112, result has 25.8 percent of original size [2024-11-16 18:58:05,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 113 [2024-11-16 18:58:06,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 18:58:06,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2024-11-16 18:58:06,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:06,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 13 [2024-11-16 18:58:06,399 INFO L349 Elim1Store]: treesize reduction 164, result has 0.6 percent of original size [2024-11-16 18:58:06,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 789 treesize of output 714 [2024-11-16 18:58:06,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 9 [2024-11-16 18:58:06,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 45 [2024-11-16 18:58:06,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 9 [2024-11-16 18:58:06,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 9 [2024-11-16 18:58:06,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2024-11-16 18:58:06,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:06,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:06,787 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 18:58:06,794 INFO L349 Elim1Store]: treesize reduction 220, result has 0.5 percent of original size [2024-11-16 18:58:06,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 104 [2024-11-16 18:58:06,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:06,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:06,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:06,834 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 18:58:06,844 INFO L349 Elim1Store]: treesize reduction 299, result has 0.3 percent of original size [2024-11-16 18:58:06,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 98 treesize of output 160 [2024-11-16 18:58:06,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:06,932 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 25 treesize of output 20 [2024-11-16 18:58:07,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:07,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:07,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:07,039 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 36 treesize of output 23 [2024-11-16 18:58:07,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:07,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2024-11-16 18:58:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 206 proven. 222 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-16 18:58:07,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:58:07,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~WrapperStruct00_var_1_20_Pointer~0.base))) (and (forall ((v_ArrVal_1176 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_1176 c_~WrapperStruct00_var_1_20_Pointer~0.offset)) v_ArrVal_1176)) (forall ((v_ArrVal_1178 (Array Int Int)) (~WrapperStruct00_var_1_18_Pointer~0.offset Int) (~WrapperStruct00_var_1_18_Pointer~0.base Int)) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_1176))) (or (not (= v_ArrVal_1178 (store (select (store .cse1 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (mod (select (select .cse1 ~WrapperStruct00_var_1_18_Pointer~0.base) ~WrapperStruct00_var_1_18_Pointer~0.offset) 256))) c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_1178 c_~WrapperStruct00_var_1_23_Pointer~0.offset)))) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1181 Int)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store .cse1 c_~WrapperStruct00_var_1_22_Pointer~0.base v_ArrVal_1177) c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_1178))) (store .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select .cse4 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_1181))))) (or (= (mod (select (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256) 0) (not (= (mod (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0)))))))))) (forall ((v_ArrVal_1176 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_1176 c_~WrapperStruct00_var_1_20_Pointer~0.offset)) v_ArrVal_1176)) (forall ((v_ArrVal_1178 (Array Int Int)) (~WrapperStruct00_var_1_18_Pointer~0.offset Int) (~WrapperStruct00_var_1_18_Pointer~0.base Int)) (let ((.cse8 (store |c_#memory_int| c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_1176))) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1181 Int)) (let ((.cse5 (let ((.cse6 (let ((.cse7 (store (store .cse8 c_~WrapperStruct00_var_1_22_Pointer~0.base v_ArrVal_1177) c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_1178))) (store .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select .cse7 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse6 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_1181))))) (or (= (mod (select (select .cse5 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0) (= (mod (select (select .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256) 1)))) (not (= v_ArrVal_1178 (store (select (store .cse8 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (mod (select (select .cse8 ~WrapperStruct00_var_1_18_Pointer~0.base) ~WrapperStruct00_var_1_18_Pointer~0.offset) 256))) c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_1178 c_~WrapperStruct00_var_1_23_Pointer~0.offset))))))))))) is different from false [2024-11-16 18:58:07,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_~WrapperStruct00_var_1_19_Pointer~0.base))) (and (forall ((v_ArrVal_1175 Int) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_19_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_19_Pointer~0.offset v_ArrVal_1175)))) (or (not (= v_ArrVal_1176 (store (select .cse0 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_1176 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))) (forall ((v_ArrVal_1178 (Array Int Int)) (~WrapperStruct00_var_1_18_Pointer~0.offset Int) (~WrapperStruct00_var_1_18_Pointer~0.base Int)) (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_1176))) (or (not (= (store (select (store .cse1 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (mod (select (select .cse1 ~WrapperStruct00_var_1_18_Pointer~0.base) ~WrapperStruct00_var_1_18_Pointer~0.offset) 256))) c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_1178 c_~WrapperStruct00_var_1_23_Pointer~0.offset)) v_ArrVal_1178)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1181 Int)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store .cse1 c_~WrapperStruct00_var_1_22_Pointer~0.base v_ArrVal_1177) c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_1178))) (store .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select .cse4 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_1181))))) (or (= (mod (select (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256) 1) (= (mod (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0)))))))))) (forall ((v_ArrVal_1175 Int) (v_ArrVal_1176 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| c_~WrapperStruct00_var_1_19_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_19_Pointer~0.offset v_ArrVal_1175)))) (or (not (= v_ArrVal_1176 (store (select .cse6 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_1176 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))) (forall ((v_ArrVal_1178 (Array Int Int)) (~WrapperStruct00_var_1_18_Pointer~0.offset Int) (~WrapperStruct00_var_1_18_Pointer~0.base Int)) (let ((.cse10 (store .cse6 c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_1176))) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1181 Int)) (let ((.cse7 (let ((.cse8 (let ((.cse9 (store (store .cse10 c_~WrapperStruct00_var_1_22_Pointer~0.base v_ArrVal_1177) c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_1178))) (store .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select .cse9 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse8 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_1181))))) (or (not (= (mod (select (select .cse7 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0)) (= (mod (select (select .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256) 0)))) (not (= (store (select (store .cse10 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (mod (select (select .cse10 ~WrapperStruct00_var_1_18_Pointer~0.base) ~WrapperStruct00_var_1_18_Pointer~0.offset) 256))) c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_1178 c_~WrapperStruct00_var_1_23_Pointer~0.offset)) v_ArrVal_1178)))))))))) is different from false [2024-11-16 18:58:08,108 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base))) (and (forall ((v_z_18 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 (Array Int Int)) (~WrapperStruct00_var_1_18_Pointer~0.offset Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (|ULTIMATE.start_step_#t~ite9#1| Int) (v_ArrVal_1181 Int) (~WrapperStruct00_var_1_18_Pointer~0.base Int)) (let ((.cse2 (let ((.cse5 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_11_Pointer~0.offset (+ v_z_18 |ULTIMATE.start_step_#t~ite9#1|))))) (store .cse5 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset v_ArrVal_1175))))) (let ((.cse0 (store .cse2 c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_1176))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store (store .cse0 c_~WrapperStruct00_var_1_22_Pointer~0.base v_ArrVal_1177) c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_1178))) (store .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select .cse4 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_1181))))) (or (not (= v_ArrVal_1178 (store (select (store .cse0 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (mod (select (select .cse0 ~WrapperStruct00_var_1_18_Pointer~0.base) ~WrapperStruct00_var_1_18_Pointer~0.offset) 256))) c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_1178 c_~WrapperStruct00_var_1_23_Pointer~0.offset)))) (not (= (mod (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0)) (< 255 v_z_18) (< v_z_18 0) (= (mod (select (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256) 0) (not (= v_ArrVal_1176 (store (select .cse2 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_1176 c_~WrapperStruct00_var_1_20_Pointer~0.offset))))))))) (forall ((v_ArrVal_1175 Int) (v_ArrVal_1178 (Array Int Int)) (~WrapperStruct00_var_1_18_Pointer~0.offset Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (|ULTIMATE.start_step_#t~ite9#1| Int) (v_z_23 Int) (v_ArrVal_1181 Int) (~WrapperStruct00_var_1_18_Pointer~0.base Int)) (let ((.cse9 (let ((.cse12 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_11_Pointer~0.offset (+ v_z_23 |ULTIMATE.start_step_#t~ite9#1|))))) (store .cse12 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse12 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset v_ArrVal_1175))))) (let ((.cse7 (store .cse9 c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_1176))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store (store .cse7 c_~WrapperStruct00_var_1_22_Pointer~0.base v_ArrVal_1177) c_~WrapperStruct00_var_1_23_Pointer~0.base v_ArrVal_1178))) (store .cse11 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select .cse11 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) (store .cse10 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_1181))))) (or (< v_z_23 0) (not (= v_ArrVal_1178 (store (select (store .cse7 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse7 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (mod (select (select .cse7 ~WrapperStruct00_var_1_18_Pointer~0.base) ~WrapperStruct00_var_1_18_Pointer~0.offset) 256))) c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select v_ArrVal_1178 c_~WrapperStruct00_var_1_23_Pointer~0.offset)))) (= (mod (select (select .cse8 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256) 1) (not (= v_ArrVal_1176 (store (select .cse9 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_1176 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))) (< 255 v_z_23) (= (mod (select (select .cse8 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) 0)))))))) is different from false [2024-11-16 18:58:08,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254835698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:58:08,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:58:08,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2024-11-16 18:58:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018384019] [2024-11-16 18:58:08,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:58:08,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-16 18:58:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:58:08,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-16 18:58:08,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1171, Unknown=3, NotChecked=216, Total=1560 [2024-11-16 18:58:08,694 INFO L87 Difference]: Start difference. First operand 136 states and 186 transitions. Second operand has 32 states, 30 states have (on average 4.666666666666667) internal successors, (140), 32 states have internal predecessors, (140), 8 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 8 states have call successors, (50) [2024-11-16 18:58:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:58:11,437 INFO L93 Difference]: Finished difference Result 333 states and 450 transitions. [2024-11-16 18:58:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 18:58:11,438 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.666666666666667) internal successors, (140), 32 states have internal predecessors, (140), 8 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 8 states have call successors, (50) Word has length 194 [2024-11-16 18:58:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:58:11,440 INFO L225 Difference]: With dead ends: 333 [2024-11-16 18:58:11,441 INFO L226 Difference]: Without dead ends: 206 [2024-11-16 18:58:11,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=478, Invalid=1981, Unknown=3, NotChecked=294, Total=2756 [2024-11-16 18:58:11,442 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 1286 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:58:11,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 694 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 18:58:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-16 18:58:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 184. [2024-11-16 18:58:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 153 states have internal predecessors, (198), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 18:58:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 252 transitions. [2024-11-16 18:58:11,480 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 252 transitions. Word has length 194 [2024-11-16 18:58:11,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:58:11,481 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 252 transitions. [2024-11-16 18:58:11,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.666666666666667) internal successors, (140), 32 states have internal predecessors, (140), 8 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 8 states have call successors, (50) [2024-11-16 18:58:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 252 transitions. [2024-11-16 18:58:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 18:58:11,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:58:11,483 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:58:11,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 18:58:11,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 18:58:11,688 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:58:11,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:58:11,688 INFO L85 PathProgramCache]: Analyzing trace with hash -688501818, now seen corresponding path program 1 times [2024-11-16 18:58:11,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:58:11,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968746444] [2024-11-16 18:58:11,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:11,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:58:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:58:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:15,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:58:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:58:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:58:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:58:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:58:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:58:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:58:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:58:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:58:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:58:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:58:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:58:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:58:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:58:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:58:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:58:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:58:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:58:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 18:58:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 18:58:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 18:58:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 18:58:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 18:58:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 18:58:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-16 18:58:16,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:58:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968746444] [2024-11-16 18:58:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968746444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:58:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710893589] [2024-11-16 18:58:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:58:16,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:58:16,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:58:16,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:58:16,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 18:58:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:58:16,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-16 18:58:16,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:58:17,112 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 [2024-11-16 18:58:17,909 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 25 treesize of output 13 [2024-11-16 18:58:18,447 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 25 treesize of output 13 [2024-11-16 18:58:19,042 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 25 treesize of output 13 [2024-11-16 18:58:19,602 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 25 treesize of output 13 [2024-11-16 18:58:20,185 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 25 treesize of output 13 [2024-11-16 18:58:20,774 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 25 treesize of output 13 [2024-11-16 18:58:21,335 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 25 treesize of output 13 [2024-11-16 18:58:21,855 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 25 treesize of output 13 [2024-11-16 18:58:22,440 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 25 treesize of output 13 [2024-11-16 18:58:23,009 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 25 treesize of output 13 [2024-11-16 18:58:23,533 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 25 treesize of output 13 [2024-11-16 18:58:24,110 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 25 treesize of output 13 [2024-11-16 18:58:24,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:24,675 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 25 treesize of output 13 [2024-11-16 18:58:24,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:24,847 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 25 treesize of output 13 [2024-11-16 18:58:24,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:24,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:24,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:24,988 INFO L349 Elim1Store]: treesize reduction 206, result has 30.2 percent of original size [2024-11-16 18:58:24,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 184 [2024-11-16 18:58:25,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46 [2024-11-16 18:58:25,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:58:25,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2024-11-16 18:58:25,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:58:25,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2024-11-16 18:58:25,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,324 INFO L349 Elim1Store]: treesize reduction 204, result has 0.5 percent of original size [2024-11-16 18:58:25,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 74 [2024-11-16 18:58:25,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,359 INFO L349 Elim1Store]: treesize reduction 204, result has 0.5 percent of original size [2024-11-16 18:58:25,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 74 [2024-11-16 18:58:25,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,433 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 25 treesize of output 13 [2024-11-16 18:58:25,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:58:25,481 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 25 treesize of output 13 [2024-11-16 18:58:25,512 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 35 treesize of output 23 [2024-11-16 18:58:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 113 proven. 162 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2024-11-16 18:58:25,515 INFO L311 TraceCheckSpWp]: Computing backward predicates...