./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:37:19,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:37:19,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:37:19,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:37:19,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:37:19,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:37:19,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:37:19,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:37:19,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:37:19,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:37:19,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:37:19,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:37:19,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:37:19,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:37:19,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:37:19,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:37:19,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:37:19,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:37:19,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:37:19,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:37:19,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:37:19,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:37:19,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:37:19,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:37:19,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:37:19,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:37:19,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:37:19,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:37:19,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:37:19,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:37:19,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:37:19,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:37:19,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:37:19,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:37:19,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:37:19,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:37:19,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:37:19,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:37:19,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:37:19,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:37:19,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:37:19,943 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:37:19,961 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:37:19,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:37:19,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:37:19,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:37:19,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:37:19,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:37:19,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:37:19,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:37:19,964 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:37:19,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:37:19,965 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:37:19,965 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:37:19,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:37:19,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:37:19,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:37:19,966 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:37:19,966 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:37:19,966 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:37:19,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:37:19,967 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:37:19,967 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:37:19,967 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:37:19,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:37:19,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:37:19,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:37:19,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:37:19,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:37:19,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:37:19,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:37:19,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:37:19,969 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:37:19,969 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:37:19,969 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:37:19,970 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:37:19,970 INFO L138 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.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-02-15 01:37:20,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:37:20,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:37:20,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:37:20,207 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:37:20,208 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:37:20,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-02-15 01:37:21,236 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:37:21,418 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:37:21,419 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-02-15 01:37:21,427 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c91ed087d/51582f2ec11b43188cb3def7cff38bc3/FLAG025c1ebd8 [2023-02-15 01:37:21,439 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c91ed087d/51582f2ec11b43188cb3def7cff38bc3 [2023-02-15 01:37:21,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:37:21,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:37:21,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:37:21,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:37:21,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:37:21,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c507ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21, skipping insertion in model container [2023-02-15 01:37:21,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:37:21,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:37:21,711 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-02-15 01:37:21,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:37:21,728 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:37:21,775 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-02-15 01:37:21,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:37:21,802 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:37:21,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21 WrapperNode [2023-02-15 01:37:21,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:37:21,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:37:21,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:37:21,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:37:21,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,858 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 178 [2023-02-15 01:37:21,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:37:21,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:37:21,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:37:21,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:37:21,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,900 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:37:21,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:37:21,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:37:21,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:37:21,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (1/1) ... [2023-02-15 01:37:21,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:37:21,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:21,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:37:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:37:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:37:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 01:37:21,989 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 01:37:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:37:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:37:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:37:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:37:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:37:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:37:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:37:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:37:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:37:21,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:37:21,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:37:22,135 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:37:22,137 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:37:22,510 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:37:22,515 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:37:22,519 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 01:37:22,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:37:22 BoogieIcfgContainer [2023-02-15 01:37:22,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:37:22,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:37:22,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:37:22,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:37:22,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:37:21" (1/3) ... [2023-02-15 01:37:22,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c7e941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:37:22, skipping insertion in model container [2023-02-15 01:37:22,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:37:21" (2/3) ... [2023-02-15 01:37:22,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c7e941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:37:22, skipping insertion in model container [2023-02-15 01:37:22,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:37:22" (3/3) ... [2023-02-15 01:37:22,528 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-02-15 01:37:22,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:37:22,540 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-02-15 01:37:22,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:37:22,589 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@22248999, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:37:22,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-02-15 01:37:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:37:22,597 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:22,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:37:22,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:22,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash 896568277, now seen corresponding path program 1 times [2023-02-15 01:37:22,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:22,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132324646] [2023-02-15 01:37:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:22,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:37:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132324646] [2023-02-15 01:37:22,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132324646] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:22,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:22,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:37:22,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091483765] [2023-02-15 01:37:22,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:22,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:37:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:22,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:37:22,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:37:22,857 INFO L87 Difference]: Start difference. First operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:37:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:22,947 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2023-02-15 01:37:22,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:37:22,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 01:37:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:22,955 INFO L225 Difference]: With dead ends: 139 [2023-02-15 01:37:22,955 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 01:37:22,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:37:22,959 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:22,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 225 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:37:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 01:37:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-02-15 01:37:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2023-02-15 01:37:22,986 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2023-02-15 01:37:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:22,987 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2023-02-15 01:37:22,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:37:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2023-02-15 01:37:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:37:22,988 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:22,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:37:22,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:37:22,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash 896568278, now seen corresponding path program 1 times [2023-02-15 01:37:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:22,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463702356] [2023-02-15 01:37:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:22,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:37:23,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:23,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463702356] [2023-02-15 01:37:23,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463702356] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:23,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:23,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:37:23,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131010648] [2023-02-15 01:37:23,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:23,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:37:23,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:23,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:37:23,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:37:23,050 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:37:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:23,115 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2023-02-15 01:37:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:37:23,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 01:37:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:23,117 INFO L225 Difference]: With dead ends: 134 [2023-02-15 01:37:23,117 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 01:37:23,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:37:23,118 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:23,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:37:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 01:37:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-02-15 01:37:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-02-15 01:37:23,125 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 6 [2023-02-15 01:37:23,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:23,125 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-02-15 01:37:23,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:37:23,126 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-02-15 01:37:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 01:37:23,126 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:23,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:23,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:37:23,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash 24922967, now seen corresponding path program 1 times [2023-02-15 01:37:23,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:23,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109482537] [2023-02-15 01:37:23,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:23,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:23,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:37:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:23,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109482537] [2023-02-15 01:37:23,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109482537] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:23,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:23,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:37:23,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457221745] [2023-02-15 01:37:23,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:23,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:37:23,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:23,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:37:23,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:37:23,217 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:37:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:23,304 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2023-02-15 01:37:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:37:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 01:37:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:23,306 INFO L225 Difference]: With dead ends: 141 [2023-02-15 01:37:23,306 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 01:37:23,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:37:23,307 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 5 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:23,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 338 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:37:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 01:37:23,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2023-02-15 01:37:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-02-15 01:37:23,314 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 13 [2023-02-15 01:37:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:23,315 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-02-15 01:37:23,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:37:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-02-15 01:37:23,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:37:23,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:23,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:23,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:37:23,316 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:23,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022556, now seen corresponding path program 1 times [2023-02-15 01:37:23,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:23,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835454246] [2023-02-15 01:37:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:23,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:23,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:37:23,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:23,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835454246] [2023-02-15 01:37:23,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835454246] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:23,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:23,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:37:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001197486] [2023-02-15 01:37:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:23,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:37:23,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:37:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:37:23,479 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:37:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:23,678 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2023-02-15 01:37:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:37:23,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-15 01:37:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:23,681 INFO L225 Difference]: With dead ends: 135 [2023-02-15 01:37:23,681 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 01:37:23,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:37:23,682 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 13 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:23,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 488 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:37:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 01:37:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2023-02-15 01:37:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-02-15 01:37:23,688 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 22 [2023-02-15 01:37:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:23,688 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-02-15 01:37:23,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:37:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-02-15 01:37:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:37:23,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:23,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:23,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:37:23,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022557, now seen corresponding path program 1 times [2023-02-15 01:37:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639571238] [2023-02-15 01:37:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:23,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:37:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:23,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639571238] [2023-02-15 01:37:23,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639571238] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:23,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:23,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:37:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746034318] [2023-02-15 01:37:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:23,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:37:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:23,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:37:23,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:37:23,869 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:37:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:24,062 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-02-15 01:37:24,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:37:24,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-15 01:37:24,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:24,063 INFO L225 Difference]: With dead ends: 134 [2023-02-15 01:37:24,063 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 01:37:24,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:37:24,064 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 11 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:24,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 512 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:37:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 01:37:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2023-02-15 01:37:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-15 01:37:24,069 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 22 [2023-02-15 01:37:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:24,070 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-15 01:37:24,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:37:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-15 01:37:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 01:37:24,071 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:24,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:24,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:37:24,071 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216453, now seen corresponding path program 1 times [2023-02-15 01:37:24,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:24,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981820254] [2023-02-15 01:37:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:24,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:24,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:24,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:37:24,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:24,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981820254] [2023-02-15 01:37:24,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981820254] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:24,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066158430] [2023-02-15 01:37:24,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:24,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:24,270 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) [2023-02-15 01:37:24,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 01:37:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:24,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 01:37:24,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:24,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-15 01:37:24,507 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2023-02-15 01:37:24,548 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2023-02-15 01:37:24,570 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:37:24,570 INFO L350 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 01:37:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 01:37:24,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:37:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:37:24,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066158430] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:37:24,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:37:24,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-15 01:37:24,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872676199] [2023-02-15 01:37:24,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:37:24,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 01:37:24,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:24,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 01:37:24,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-15 01:37:24,816 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:37:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:25,131 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2023-02-15 01:37:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:37:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-15 01:37:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:25,133 INFO L225 Difference]: With dead ends: 150 [2023-02-15 01:37:25,133 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 01:37:25,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-15 01:37:25,134 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 242 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:25,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 581 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 527 Invalid, 0 Unknown, 280 Unchecked, 0.3s Time] [2023-02-15 01:37:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 01:37:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2023-02-15 01:37:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 127 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2023-02-15 01:37:25,138 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 25 [2023-02-15 01:37:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:25,139 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2023-02-15 01:37:25,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:37:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2023-02-15 01:37:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 01:37:25,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:25,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:25,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:37:25,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 01:37:25,345 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216454, now seen corresponding path program 1 times [2023-02-15 01:37:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:25,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256783895] [2023-02-15 01:37:25,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:25,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:37:25,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:25,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256783895] [2023-02-15 01:37:25,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256783895] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:25,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196539490] [2023-02-15 01:37:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:25,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:25,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:25,706 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) [2023-02-15 01:37:25,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 01:37:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:25,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 01:37:25,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:25,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-15 01:37:26,014 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:37:26,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:37:26,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 11 [2023-02-15 01:37:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:37:26,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:37:26,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196539490] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:26,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:37:26,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-15 01:37:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800969110] [2023-02-15 01:37:26,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:37:26,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 01:37:26,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:26,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 01:37:26,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-02-15 01:37:26,164 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:37:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:26,627 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2023-02-15 01:37:26,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:37:26,628 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-02-15 01:37:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:26,628 INFO L225 Difference]: With dead ends: 133 [2023-02-15 01:37:26,628 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 01:37:26,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-02-15 01:37:26,630 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 131 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:26,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 751 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:37:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 01:37:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2023-02-15 01:37:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 126 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2023-02-15 01:37:26,634 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 25 [2023-02-15 01:37:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:26,634 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2023-02-15 01:37:26,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:37:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2023-02-15 01:37:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:37:26,635 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:26,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:26,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:37:26,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-15 01:37:26,841 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:26,841 INFO L85 PathProgramCache]: Analyzing trace with hash -148939745, now seen corresponding path program 1 times [2023-02-15 01:37:26,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:26,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650307080] [2023-02-15 01:37:26,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:26,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:27,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:27,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:27,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 01:37:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650307080] [2023-02-15 01:37:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650307080] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703842481] [2023-02-15 01:37:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:27,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:27,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:27,145 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) [2023-02-15 01:37:27,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 01:37:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:27,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 01:37:27,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:27,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-15 01:37:27,277 INFO L350 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 5 treesize of output 3 [2023-02-15 01:37:27,291 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 01:37:27,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:27,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 01:37:27,331 INFO L350 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 5 treesize of output 3 [2023-02-15 01:37:27,338 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_522))))) is different from true [2023-02-15 01:37:27,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:27,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 01:37:27,381 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 01:37:27,395 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:37:27,396 INFO L350 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:37:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2023-02-15 01:37:27,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:37:27,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703842481] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:27,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:37:27,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2023-02-15 01:37:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966086304] [2023-02-15 01:37:27,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:37:27,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 01:37:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:27,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 01:37:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=122, Unknown=3, NotChecked=72, Total=240 [2023-02-15 01:37:27,545 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 01:37:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:27,849 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2023-02-15 01:37:27,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:37:27,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2023-02-15 01:37:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:27,850 INFO L225 Difference]: With dead ends: 140 [2023-02-15 01:37:27,851 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 01:37:27,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=163, Unknown=3, NotChecked=84, Total=306 [2023-02-15 01:37:27,851 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 222 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 438 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:27,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 409 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 457 Invalid, 0 Unknown, 438 Unchecked, 0.3s Time] [2023-02-15 01:37:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 01:37:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2023-02-15 01:37:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-02-15 01:37:27,855 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 37 [2023-02-15 01:37:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:27,855 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-02-15 01:37:27,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 01:37:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-02-15 01:37:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:37:27,856 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:27,857 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:27,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:37:28,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:28,063 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:28,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:28,063 INFO L85 PathProgramCache]: Analyzing trace with hash -148939744, now seen corresponding path program 1 times [2023-02-15 01:37:28,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:28,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109644017] [2023-02-15 01:37:28,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:28,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:28,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:37:28,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:28,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109644017] [2023-02-15 01:37:28,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109644017] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:28,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:28,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:37:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830868827] [2023-02-15 01:37:28,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:28,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:37:28,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:28,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:37:28,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:37:28,411 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:28,640 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2023-02-15 01:37:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:37:28,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2023-02-15 01:37:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:28,641 INFO L225 Difference]: With dead ends: 131 [2023-02-15 01:37:28,641 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 01:37:28,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:37:28,642 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 420 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:28,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 193 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:37:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 01:37:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2023-02-15 01:37:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.63013698630137) internal successors, (119), 108 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2023-02-15 01:37:28,645 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 37 [2023-02-15 01:37:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:28,645 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2023-02-15 01:37:28,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2023-02-15 01:37:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:37:28,646 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:28,646 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:28,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 01:37:28,647 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:28,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash -362722266, now seen corresponding path program 1 times [2023-02-15 01:37:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:28,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055163575] [2023-02-15 01:37:28,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:28,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:28,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:28,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:28,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:37:29,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:29,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055163575] [2023-02-15 01:37:29,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055163575] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:29,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433892281] [2023-02-15 01:37:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:29,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:29,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:29,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:37:29,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 01:37:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:29,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 01:37:29,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:29,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 01:37:29,424 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_782 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_782)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:37:29,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:29,447 INFO L350 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 16 treesize of output 18 [2023-02-15 01:37:29,459 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-15 01:37:29,459 INFO L350 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 2 case distinctions, treesize of input 23 treesize of output 24 [2023-02-15 01:37:29,483 INFO L350 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 17 treesize of output 9 [2023-02-15 01:37:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:37:29,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:37:29,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433892281] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:29,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:37:29,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 24 [2023-02-15 01:37:29,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756727292] [2023-02-15 01:37:29,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:29,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 01:37:29,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:29,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 01:37:29,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2023-02-15 01:37:29,489 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:37:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:29,852 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2023-02-15 01:37:29,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:37:29,853 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2023-02-15 01:37:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:29,854 INFO L225 Difference]: With dead ends: 222 [2023-02-15 01:37:29,854 INFO L226 Difference]: Without dead ends: 222 [2023-02-15 01:37:29,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=716, Unknown=1, NotChecked=56, Total=930 [2023-02-15 01:37:29,855 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 774 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:29,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 388 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 468 Invalid, 0 Unknown, 128 Unchecked, 0.2s Time] [2023-02-15 01:37:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-15 01:37:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 115. [2023-02-15 01:37:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.64) internal successors, (123), 110 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2023-02-15 01:37:29,857 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 40 [2023-02-15 01:37:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:29,857 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2023-02-15 01:37:29,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:37:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2023-02-15 01:37:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:37:29,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:29,858 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:29,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:37:30,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:30,064 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:30,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash -362722265, now seen corresponding path program 1 times [2023-02-15 01:37:30,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:30,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783027789] [2023-02-15 01:37:30,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:30,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:30,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:30,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:30,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:37:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:30,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783027789] [2023-02-15 01:37:30,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783027789] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:30,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194137415] [2023-02-15 01:37:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:30,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:30,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:30,729 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:37:30,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 01:37:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:30,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 01:37:30,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:30,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-15 01:37:30,910 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_938 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_938))) is different from true [2023-02-15 01:37:30,924 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_938 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_938))) is different from true [2023-02-15 01:37:30,936 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:37:30,936 INFO L350 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 01:37:31,059 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:37:31,059 INFO L350 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 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 01:37:31,448 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_943 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_943))) (exists ((v_ArrVal_940 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_940) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_944 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_944))))) is different from true [2023-02-15 01:37:31,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:31,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 24 [2023-02-15 01:37:31,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:31,482 INFO L350 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 31 treesize of output 31 [2023-02-15 01:37:31,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:31,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-15 01:37:31,502 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-02-15 01:37:31,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 01:37:31,537 INFO L350 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 23 treesize of output 15 [2023-02-15 01:37:31,538 INFO L350 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 26 treesize of output 14 [2023-02-15 01:37:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2023-02-15 01:37:31,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:37:32,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194137415] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:32,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:37:32,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 40 [2023-02-15 01:37:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712027076] [2023-02-15 01:37:32,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:37:32,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 01:37:32,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 01:37:32,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1598, Unknown=4, NotChecked=246, Total=1980 [2023-02-15 01:37:32,246 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:37:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:34,056 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2023-02-15 01:37:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 01:37:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2023-02-15 01:37:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:34,058 INFO L225 Difference]: With dead ends: 240 [2023-02-15 01:37:34,058 INFO L226 Difference]: Without dead ends: 240 [2023-02-15 01:37:34,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=349, Invalid=2739, Unknown=4, NotChecked=330, Total=3422 [2023-02-15 01:37:34,059 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 1479 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:34,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 828 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1652 Invalid, 0 Unknown, 726 Unchecked, 0.9s Time] [2023-02-15 01:37:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-02-15 01:37:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 115. [2023-02-15 01:37:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 110 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2023-02-15 01:37:34,062 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 40 [2023-02-15 01:37:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:34,062 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2023-02-15 01:37:34,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:37:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2023-02-15 01:37:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 01:37:34,063 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:34,063 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:34,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 01:37:34,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 01:37:34,272 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1640510023, now seen corresponding path program 1 times [2023-02-15 01:37:34,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:34,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928171302] [2023-02-15 01:37:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:34,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:37:34,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:34,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928171302] [2023-02-15 01:37:34,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928171302] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:34,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:34,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:37:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516668693] [2023-02-15 01:37:34,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:34,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:37:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:37:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:37:34,336 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:37:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:34,399 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2023-02-15 01:37:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:37:34,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2023-02-15 01:37:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:34,401 INFO L225 Difference]: With dead ends: 177 [2023-02-15 01:37:34,401 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 01:37:34,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:37:34,401 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:34,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 273 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:37:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 01:37:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 116. [2023-02-15 01:37:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 76 states have (on average 1.618421052631579) internal successors, (123), 111 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2023-02-15 01:37:34,406 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 41 [2023-02-15 01:37:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:34,406 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2023-02-15 01:37:34,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:37:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2023-02-15 01:37:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:37:34,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:34,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:34,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 01:37:34,411 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:34,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:34,411 INFO L85 PathProgramCache]: Analyzing trace with hash 277382184, now seen corresponding path program 1 times [2023-02-15 01:37:34,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:34,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019113983] [2023-02-15 01:37:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:34,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 01:37:34,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:34,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019113983] [2023-02-15 01:37:34,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019113983] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:34,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:34,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:37:34,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522816553] [2023-02-15 01:37:34,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:34,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:37:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:34,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:37:34,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:37:34,512 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:37:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:34,648 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2023-02-15 01:37:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:37:34,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2023-02-15 01:37:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:34,649 INFO L225 Difference]: With dead ends: 131 [2023-02-15 01:37:34,649 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 01:37:34,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:37:34,650 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 90 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:34,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 337 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:37:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 01:37:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2023-02-15 01:37:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 108 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2023-02-15 01:37:34,652 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 43 [2023-02-15 01:37:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:34,652 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2023-02-15 01:37:34,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:37:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2023-02-15 01:37:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:37:34,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:34,653 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:34,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 01:37:34,653 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:34,654 INFO L85 PathProgramCache]: Analyzing trace with hash 277382185, now seen corresponding path program 1 times [2023-02-15 01:37:34,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:34,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539711662] [2023-02-15 01:37:34,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:34,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 01:37:34,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:34,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539711662] [2023-02-15 01:37:34,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539711662] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:34,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162880228] [2023-02-15 01:37:34,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:34,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:34,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:34,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:37:34,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 01:37:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:34,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:37:34,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:37:35,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:37:35,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162880228] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:35,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:37:35,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-15 01:37:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059767116] [2023-02-15 01:37:35,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:35,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:37:35,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:35,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:37:35,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:37:35,012 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:37:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:35,025 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-02-15 01:37:35,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:37:35,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2023-02-15 01:37:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:35,026 INFO L225 Difference]: With dead ends: 112 [2023-02-15 01:37:35,026 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 01:37:35,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:37:35,027 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 104 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:35,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 234 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:37:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 01:37:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-02-15 01:37:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.5733333333333333) internal successors, (118), 107 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2023-02-15 01:37:35,030 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 43 [2023-02-15 01:37:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:35,030 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2023-02-15 01:37:35,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:37:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2023-02-15 01:37:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:37:35,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:35,031 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:35,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 01:37:35,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:35,237 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:35,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:35,238 INFO L85 PathProgramCache]: Analyzing trace with hash 278707084, now seen corresponding path program 1 times [2023-02-15 01:37:35,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:35,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524183003] [2023-02-15 01:37:35,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:35,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 01:37:35,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:35,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524183003] [2023-02-15 01:37:35,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524183003] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:35,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775547884] [2023-02-15 01:37:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:35,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:35,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:35,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:37:35,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 01:37:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:35,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 01:37:35,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:37:35,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:37:35,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775547884] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:35,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:37:35,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-15 01:37:35,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892899205] [2023-02-15 01:37:35,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:35,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:37:35,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:37:35,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:37:35,626 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:37:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:35,643 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2023-02-15 01:37:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:37:35,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2023-02-15 01:37:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:35,644 INFO L225 Difference]: With dead ends: 109 [2023-02-15 01:37:35,644 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 01:37:35,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:37:35,648 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 187 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:35,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:37:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 01:37:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-02-15 01:37:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 104 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2023-02-15 01:37:35,651 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 43 [2023-02-15 01:37:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:35,651 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2023-02-15 01:37:35,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:37:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2023-02-15 01:37:35,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 01:37:35,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:35,653 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:35,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:37:35,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:35,860 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash 49983393, now seen corresponding path program 1 times [2023-02-15 01:37:35,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:35,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453868093] [2023-02-15 01:37:35,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:35,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:35,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:35,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:37:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453868093] [2023-02-15 01:37:35,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453868093] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:35,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:35,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:37:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121771828] [2023-02-15 01:37:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:35,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:37:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:37:35,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:37:35,932 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:37:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:36,032 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2023-02-15 01:37:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:37:36,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-02-15 01:37:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:36,033 INFO L225 Difference]: With dead ends: 126 [2023-02-15 01:37:36,033 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 01:37:36,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:37:36,034 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 84 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:36,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 225 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:37:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 01:37:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2023-02-15 01:37:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.527027027027027) internal successors, (113), 103 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2023-02-15 01:37:36,038 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 44 [2023-02-15 01:37:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:36,038 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2023-02-15 01:37:36,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:37:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2023-02-15 01:37:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 01:37:36,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:36,040 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:36,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 01:37:36,040 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:36,041 INFO L85 PathProgramCache]: Analyzing trace with hash 49983394, now seen corresponding path program 1 times [2023-02-15 01:37:36,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:36,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168453726] [2023-02-15 01:37:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:37:36,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:36,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168453726] [2023-02-15 01:37:36,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168453726] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:36,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:36,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:37:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263901242] [2023-02-15 01:37:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:36,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:37:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:37:36,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:37:36,128 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:37:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:36,247 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2023-02-15 01:37:36,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:37:36,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-02-15 01:37:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:36,248 INFO L225 Difference]: With dead ends: 107 [2023-02-15 01:37:36,248 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 01:37:36,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:37:36,248 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 87 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:36,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 218 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:37:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 01:37:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-15 01:37:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 102 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2023-02-15 01:37:36,251 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 44 [2023-02-15 01:37:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:36,251 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2023-02-15 01:37:36,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:37:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2023-02-15 01:37:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:37:36,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:36,252 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:36,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 01:37:36,252 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:36,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1549485211, now seen corresponding path program 1 times [2023-02-15 01:37:36,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:36,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492639987] [2023-02-15 01:37:36,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:36,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:36,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:36,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 01:37:36,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:36,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492639987] [2023-02-15 01:37:36,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492639987] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:37:36,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:37:36,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:37:36,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57213895] [2023-02-15 01:37:36,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:37:36,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:37:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:36,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:37:36,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:37:36,410 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:37:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:36,555 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-02-15 01:37:36,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:37:36,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-15 01:37:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:36,556 INFO L225 Difference]: With dead ends: 104 [2023-02-15 01:37:36,556 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 01:37:36,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:37:36,556 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 84 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:36,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 340 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:37:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 01:37:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-02-15 01:37:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.472972972972973) internal successors, (109), 99 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2023-02-15 01:37:36,558 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 45 [2023-02-15 01:37:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:36,558 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2023-02-15 01:37:36,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:37:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2023-02-15 01:37:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:37:36,559 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:36,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:36,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 01:37:36,559 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2108722015, now seen corresponding path program 1 times [2023-02-15 01:37:36,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:36,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131991336] [2023-02-15 01:37:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:36,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:37,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:37,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:37:37,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:37,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131991336] [2023-02-15 01:37:37,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131991336] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:37,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451969501] [2023-02-15 01:37:37,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:37,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:37,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:37,188 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:37:37,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 01:37:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:37,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-15 01:37:37,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:37,594 INFO L350 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 11 treesize of output 7 [2023-02-15 01:37:37,671 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:37:37,671 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2023-02-15 01:37:37,674 INFO L350 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 13 treesize of output 9 [2023-02-15 01:37:37,792 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:37:37,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-02-15 01:37:37,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:37,913 INFO L321 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-02-15 01:37:37,913 INFO L350 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 35 [2023-02-15 01:37:37,921 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:37:38,255 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:37:38,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 54 [2023-02-15 01:37:38,263 INFO L350 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 7 treesize of output 5 [2023-02-15 01:37:38,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:38,311 INFO L350 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 24 treesize of output 24 [2023-02-15 01:37:38,347 INFO L350 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 25 treesize of output 13 [2023-02-15 01:37:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:37:38,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:37:38,357 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 01:37:44,464 INFO L321 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2023-02-15 01:37:44,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-02-15 01:37:50,591 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1943) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) is different from false [2023-02-15 01:37:50,653 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1943) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 01:37:50,658 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1943) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 01:37:50,692 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_13| Int) (v_ArrVal_1948 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_13| v_ArrVal_1948))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= .cse0 (select (select (store (store .cse1 .cse0 v_ArrVal_1943) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_13| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_13| |c_#StackHeapBarrier|)))) is different from false [2023-02-15 01:37:50,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451969501] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:50,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:37:50,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 45 [2023-02-15 01:37:50,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084690416] [2023-02-15 01:37:50,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:37:50,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 01:37:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 01:37:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2165, Unknown=35, NotChecked=490, Total=2862 [2023-02-15 01:37:50,698 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 46 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 39 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:37:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:53,706 INFO L93 Difference]: Finished difference Result 317 states and 351 transitions. [2023-02-15 01:37:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 01:37:53,707 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 39 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2023-02-15 01:37:53,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:53,708 INFO L225 Difference]: With dead ends: 317 [2023-02-15 01:37:53,708 INFO L226 Difference]: Without dead ends: 317 [2023-02-15 01:37:53,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=789, Invalid=6678, Unknown=35, NotChecked=870, Total=8372 [2023-02-15 01:37:53,711 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2397 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:53,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 1302 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 01:37:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-02-15 01:37:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 105. [2023-02-15 01:37:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 100 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:37:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2023-02-15 01:37:53,714 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 49 [2023-02-15 01:37:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:53,714 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2023-02-15 01:37:53,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 39 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:37:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2023-02-15 01:37:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:37:53,715 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:53,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:53,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 01:37:53,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:53,916 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:37:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2108722016, now seen corresponding path program 1 times [2023-02-15 01:37:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:53,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769972014] [2023-02-15 01:37:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:54,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:37:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:54,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:37:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:55,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:37:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:37:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:55,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769972014] [2023-02-15 01:37:55,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769972014] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:55,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413207570] [2023-02-15 01:37:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:55,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:55,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:55,473 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:37:55,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 01:37:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:55,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 01:37:55,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:56,157 INFO L350 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 32 treesize of output 20 [2023-02-15 01:37:56,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:37:56,164 INFO L350 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 5 treesize of output 3 [2023-02-15 01:37:56,167 INFO L350 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 5 treesize of output 3 [2023-02-15 01:37:56,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:56,415 INFO L350 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 42 treesize of output 33 [2023-02-15 01:37:56,429 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-15 01:37:56,430 INFO L350 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 1 case distinctions, treesize of input 24 treesize of output 27 [2023-02-15 01:37:56,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:56,434 INFO L350 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 18 [2023-02-15 01:37:56,449 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:37:56,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:37:56,890 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:37:56,891 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2023-02-15 01:37:56,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:56,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:37:56,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:56,972 INFO L350 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 39 treesize of output 37 [2023-02-15 01:37:56,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:56,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-15 01:37:57,046 INFO L350 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 32 treesize of output 20 [2023-02-15 01:37:57,048 INFO L350 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 26 treesize of output 14 [2023-02-15 01:37:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:37:57,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:02,271 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (and (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int)) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2133) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 01:38:02,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413207570] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:02,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:38:02,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 50 [2023-02-15 01:38:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095034830] [2023-02-15 01:38:02,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:02,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 01:38:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 01:38:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3198, Unknown=135, NotChecked=116, Total=3660 [2023-02-15 01:38:02,514 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 51 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 44 states have internal predecessors, (80), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:38:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:07,148 INFO L93 Difference]: Finished difference Result 257 states and 288 transitions. [2023-02-15 01:38:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 01:38:07,149 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 44 states have internal predecessors, (80), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2023-02-15 01:38:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:07,150 INFO L225 Difference]: With dead ends: 257 [2023-02-15 01:38:07,150 INFO L226 Difference]: Without dead ends: 257 [2023-02-15 01:38:07,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=648, Invalid=7403, Unknown=143, NotChecked=178, Total=8372 [2023-02-15 01:38:07,152 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 664 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 2958 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:07,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1956 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2958 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 01:38:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-02-15 01:38:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 107. [2023-02-15 01:38:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.4125) internal successors, (113), 102 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2023-02-15 01:38:07,155 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 49 [2023-02-15 01:38:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:07,156 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2023-02-15 01:38:07,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 44 states have internal predecessors, (80), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:38:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2023-02-15 01:38:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 01:38:07,156 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:07,156 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:07,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 01:38:07,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:07,363 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:38:07,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash 776998409, now seen corresponding path program 1 times [2023-02-15 01:38:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:07,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528562222] [2023-02-15 01:38:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:07,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:07,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:38:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:07,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:38:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:07,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:38:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:38:07,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:07,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528562222] [2023-02-15 01:38:07,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528562222] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:07,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942540840] [2023-02-15 01:38:07,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:07,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:07,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:07,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:38:07,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 01:38:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:07,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 01:38:07,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:07,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:38:07,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:38:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:38:07,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:38:07,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942540840] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:38:07,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:38:07,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2023-02-15 01:38:07,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608354947] [2023-02-15 01:38:07,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:07,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:38:07,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:07,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:38:07,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:38:07,868 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:38:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:07,984 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2023-02-15 01:38:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:38:07,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2023-02-15 01:38:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:07,985 INFO L225 Difference]: With dead ends: 99 [2023-02-15 01:38:07,988 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 01:38:07,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-15 01:38:07,989 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 8 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:07,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 748 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 01:38:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-02-15 01:38:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 94 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2023-02-15 01:38:07,999 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 50 [2023-02-15 01:38:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:07,999 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2023-02-15 01:38:07,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:38:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2023-02-15 01:38:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:38:08,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:08,000 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:08,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 01:38:08,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 01:38:08,207 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:38:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash -742704791, now seen corresponding path program 1 times [2023-02-15 01:38:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:08,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468148293] [2023-02-15 01:38:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:09,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:38:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:09,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:38:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:09,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:38:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:38:10,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:10,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468148293] [2023-02-15 01:38:10,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468148293] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:10,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440715862] [2023-02-15 01:38:10,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:10,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:10,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:10,213 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:38:10,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 01:38:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:10,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-15 01:38:10,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:10,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-15 01:38:10,711 INFO L350 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 13 treesize of output 9 [2023-02-15 01:38:10,820 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:38:10,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:38:10,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 01:38:11,090 INFO L350 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 14 treesize of output 16 [2023-02-15 01:38:11,307 INFO L350 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 30 treesize of output 18 [2023-02-15 01:38:11,311 INFO L350 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 7 treesize of output 3 [2023-02-15 01:38:11,315 INFO L350 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 5 treesize of output 3 [2023-02-15 01:38:11,319 INFO L350 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 7 treesize of output 3 [2023-02-15 01:38:11,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:11,606 INFO L350 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 16 treesize of output 11 [2023-02-15 01:38:11,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:11,612 INFO L350 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 38 treesize of output 29 [2023-02-15 01:38:11,619 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:38:11,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:38:11,623 INFO L350 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 20 treesize of output 15 [2023-02-15 01:38:11,987 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:38:11,988 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2023-02-15 01:38:12,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2023-02-15 01:38:12,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:12,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 01:38:12,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:12,088 INFO L350 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 35 treesize of output 33 [2023-02-15 01:38:12,095 INFO L350 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 18 treesize of output 20 [2023-02-15 01:38:12,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:12,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:38:12,170 INFO L350 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 28 treesize of output 16 [2023-02-15 01:38:12,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:38:12,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:38:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:38:12,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:12,461 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2509 (Array Int Int)) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2508) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 01:38:14,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440715862] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:14,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:38:14,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 59 [2023-02-15 01:38:14,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059536505] [2023-02-15 01:38:14,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:14,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-15 01:38:14,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:14,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-15 01:38:14,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4311, Unknown=1, NotChecked=132, Total=4692 [2023-02-15 01:38:14,082 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:38:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:17,114 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2023-02-15 01:38:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 01:38:17,114 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2023-02-15 01:38:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:17,115 INFO L225 Difference]: With dead ends: 202 [2023-02-15 01:38:17,115 INFO L226 Difference]: Without dead ends: 202 [2023-02-15 01:38:17,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=631, Invalid=7744, Unknown=1, NotChecked=180, Total=8556 [2023-02-15 01:38:17,117 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 571 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:17,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1668 Invalid, 2457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 01:38:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-15 01:38:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 123. [2023-02-15 01:38:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 116 states have internal predecessors, (128), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:38:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2023-02-15 01:38:17,120 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 51 [2023-02-15 01:38:17,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:17,120 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2023-02-15 01:38:17,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:38:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2023-02-15 01:38:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:38:17,120 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:17,121 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:17,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 01:38:17,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 01:38:17,321 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:38:17,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash 106624317, now seen corresponding path program 1 times [2023-02-15 01:38:17,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:17,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008058096] [2023-02-15 01:38:17,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:17,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:38:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:38:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:17,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:38:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 01:38:17,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:17,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008058096] [2023-02-15 01:38:17,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008058096] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:17,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:17,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:38:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807472073] [2023-02-15 01:38:17,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:17,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:38:17,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:17,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:38:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:38:17,577 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:38:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:17,927 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2023-02-15 01:38:17,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:38:17,928 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-15 01:38:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:17,929 INFO L225 Difference]: With dead ends: 200 [2023-02-15 01:38:17,929 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 01:38:17,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:38:17,929 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 240 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:17,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 659 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:38:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 01:38:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 124. [2023-02-15 01:38:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 117 states have internal predecessors, (130), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:38:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2023-02-15 01:38:17,932 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 51 [2023-02-15 01:38:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:17,932 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2023-02-15 01:38:17,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:38:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2023-02-15 01:38:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:38:17,933 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:17,933 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:17,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 01:38:17,933 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:38:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash 106624318, now seen corresponding path program 1 times [2023-02-15 01:38:17,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:17,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363558677] [2023-02-15 01:38:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:18,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:38:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:18,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:38:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:18,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:38:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 01:38:18,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:18,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363558677] [2023-02-15 01:38:18,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363558677] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:18,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:18,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:38:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239596370] [2023-02-15 01:38:18,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:18,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:38:18,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:38:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:38:18,276 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:38:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:18,688 INFO L93 Difference]: Finished difference Result 182 states and 204 transitions. [2023-02-15 01:38:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:38:18,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-15 01:38:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:18,689 INFO L225 Difference]: With dead ends: 182 [2023-02-15 01:38:18,689 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 01:38:18,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:38:18,690 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 210 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:18,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 737 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:38:18,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 01:38:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 120. [2023-02-15 01:38:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 113 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:38:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2023-02-15 01:38:18,692 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 51 [2023-02-15 01:38:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:18,692 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2023-02-15 01:38:18,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:38:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2023-02-15 01:38:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 01:38:18,693 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:18,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:18,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 01:38:18,693 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:38:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash -613243961, now seen corresponding path program 1 times [2023-02-15 01:38:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:18,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355030603] [2023-02-15 01:38:18,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:18,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:18,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:38:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:18,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:38:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:38:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:38:18,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:18,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355030603] [2023-02-15 01:38:18,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355030603] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:18,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085726426] [2023-02-15 01:38:18,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:18,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:18,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:18,927 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:38:18,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 01:38:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:19,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 01:38:19,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:19,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 01:38:19,161 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2921 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2921))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-02-15 01:38:19,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 01:38:19,186 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2922 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2922))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-02-15 01:38:19,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 01:38:19,219 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2923 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2923))))) is different from true [2023-02-15 01:38:19,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 01:38:19,238 INFO L350 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 7 treesize of output 3 [2023-02-15 01:38:19,253 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:38:19,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:38:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-15 01:38:19,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 01:38:19,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085726426] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:38:19,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:38:19,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2023-02-15 01:38:19,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483906537] [2023-02-15 01:38:19,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:19,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 01:38:19,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 01:38:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2023-02-15 01:38:19,621 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 01:38:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:19,792 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2023-02-15 01:38:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:38:19,792 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 53 [2023-02-15 01:38:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:19,793 INFO L225 Difference]: With dead ends: 116 [2023-02-15 01:38:19,793 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 01:38:19,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=247, Unknown=3, NotChecked=108, Total=462 [2023-02-15 01:38:19,794 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 280 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:19,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 223 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 184 Invalid, 0 Unknown, 273 Unchecked, 0.1s Time] [2023-02-15 01:38:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 01:38:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-02-15 01:38:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 109 states have internal predecessors, (119), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:38:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2023-02-15 01:38:19,796 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 53 [2023-02-15 01:38:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:19,797 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2023-02-15 01:38:19,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 01:38:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2023-02-15 01:38:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 01:38:19,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:19,797 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:19,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 01:38:19,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 01:38:19,998 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 01:38:19,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:19,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1524453912, now seen corresponding path program 1 times [2023-02-15 01:38:19,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:19,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249378834] [2023-02-15 01:38:19,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:19,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:20,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:38:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 01:38:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:38:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:38:20,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:20,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249378834] [2023-02-15 01:38:20,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249378834] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:20,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002865513] [2023-02-15 01:38:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:20,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:20,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:20,977 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:38:20,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 01:38:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:21,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-15 01:38:21,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:21,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:38:21,573 INFO L350 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 5 treesize of output 3 [2023-02-15 01:38:21,680 INFO L350 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 6 treesize of output 5 [2023-02-15 01:38:21,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:21,776 INFO L350 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 25 [2023-02-15 01:38:21,786 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:38:21,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:38:22,103 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 01:38:22,103 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 37 [2023-02-15 01:38:22,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:22,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 01:38:22,161 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 01:38:22,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 83 [2023-02-15 01:38:22,170 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:38:22,170 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 72 [2023-02-15 01:38:22,218 INFO L350 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 62 treesize of output 46 [2023-02-15 01:38:22,352 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:38:22,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 26 [2023-02-15 01:38:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:38:22,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:22,371 INFO L321 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2023-02-15 01:38:22,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-02-15 01:38:22,443 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3114) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-15 01:38:22,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3114) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-15 01:38:22,489 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3114) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-15 01:38:22,494 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3114) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-15 01:38:22,500 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3114) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) is different from false [2023-02-15 01:38:22,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:22,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5900 treesize of output 5623 [2023-02-15 01:38:22,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:22,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5612 treesize of output 5476 [2023-02-15 01:38:22,592 INFO L350 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 5468 treesize of output 5404 [2023-02-15 01:38:22,600 INFO L350 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 5404 treesize of output 5372