./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e 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/sll2n_insert_equal.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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:55:17,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:55:17,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:55:18,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:55:18,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:55:18,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:55:18,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:55:18,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:55:18,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:55:18,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:55:18,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:55:18,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:55:18,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:55:18,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:55:18,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:55:18,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:55:18,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:55:18,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:55:18,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:55:18,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:55:18,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:55:18,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:55:18,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:55:18,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:55:18,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:55:18,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:55:18,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:55:18,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:55:18,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:55:18,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:55:18,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:55:18,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:55:18,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:55:18,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:55:18,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:55:18,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:55:18,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:55:18,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:55:18,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:55:18,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:55:18,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:55:18,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 08:55:18,108 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:55:18,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:55:18,108 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:55:18,108 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:55:18,109 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:55:18,109 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:55:18,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:55:18,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:55:18,110 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:55:18,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:55:18,111 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:55:18,111 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:55:18,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:55:18,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:55:18,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:55:18,111 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:55:18,111 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:55:18,112 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:55:18,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:55:18,112 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:55:18,112 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:55:18,112 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:55:18,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:55:18,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:55:18,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:55:18,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:55:18,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:55:18,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:55:18,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:55:18,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:55:18,114 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:55:18,114 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:55:18,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:55:18,114 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:55:18,114 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2023-02-17 08:55:18,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:55:18,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:55:18,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:55:18,351 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:55:18,351 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:55:18,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-17 08:55:19,412 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:55:19,559 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:55:19,559 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-17 08:55:19,566 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe542a51/1e25dbf2531940148d4627f8a6b86b80/FLAG191613398 [2023-02-17 08:55:19,589 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe542a51/1e25dbf2531940148d4627f8a6b86b80 [2023-02-17 08:55:19,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:55:19,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:55:19,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:55:19,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:55:19,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:55:19,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:19,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e7687d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19, skipping insertion in model container [2023-02-17 08:55:19,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:19,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:55:19,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:55:19,862 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/sll2n_insert_equal.i[24301,24314] [2023-02-17 08:55:19,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:55:19,875 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:55:19,915 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/sll2n_insert_equal.i[24301,24314] [2023-02-17 08:55:19,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:55:19,964 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:55:19,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19 WrapperNode [2023-02-17 08:55:19,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:55:19,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:55:19,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:55:19,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:55:19,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,033 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2023-02-17 08:55:20,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:55:20,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:55:20,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:55:20,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:55:20,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,057 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:55:20,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:55:20,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:55:20,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:55:20,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (1/1) ... [2023-02-17 08:55:20,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:55:20,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:55:20,083 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-17 08:55:20,097 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-17 08:55:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 08:55:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 08:55:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-17 08:55:20,113 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-17 08:55:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 08:55:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 08:55:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 08:55:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 08:55:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 08:55:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:55:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 08:55:20,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 08:55:20,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:55:20,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:55:20,192 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:55:20,193 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:55:20,440 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:55:20,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:55:20,452 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-17 08:55:20,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:55:20 BoogieIcfgContainer [2023-02-17 08:55:20,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:55:20,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:55:20,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:55:20,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:55:20,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:55:19" (1/3) ... [2023-02-17 08:55:20,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab0941d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:55:20, skipping insertion in model container [2023-02-17 08:55:20,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:55:19" (2/3) ... [2023-02-17 08:55:20,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab0941d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:55:20, skipping insertion in model container [2023-02-17 08:55:20,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:55:20" (3/3) ... [2023-02-17 08:55:20,463 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2023-02-17 08:55:20,475 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:55:20,475 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-02-17 08:55:20,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:55:20,521 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;@5d8ac066, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:55:20,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-02-17 08:55:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 78 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 08:55:20,529 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:20,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:20,530 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:20,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843193, now seen corresponding path program 1 times [2023-02-17 08:55:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:20,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881765351] [2023-02-17 08:55:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:20,743 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-17 08:55:20,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:20,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881765351] [2023-02-17 08:55:20,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881765351] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:20,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:20,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:55:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14970392] [2023-02-17 08:55:20,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:20,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:55:20,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:20,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:55:20,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:55:20,785 INFO L87 Difference]: Start difference. First operand has 82 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 78 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 08:55:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:20,842 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-17 08:55:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:55:20,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2023-02-17 08:55:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:20,848 INFO L225 Difference]: With dead ends: 80 [2023-02-17 08:55:20,848 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 08:55:20,849 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-17 08:55:20,851 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:20,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 126 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:55:20,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 08:55:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-17 08:55:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-17 08:55:20,877 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2023-02-17 08:55:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:20,877 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-17 08:55:20,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 08:55:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-17 08:55:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 08:55:20,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:20,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:20,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 08:55:20,878 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:20,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843194, now seen corresponding path program 1 times [2023-02-17 08:55:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:20,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193887356] [2023-02-17 08:55:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:20,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:20,985 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-17 08:55:20,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:20,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193887356] [2023-02-17 08:55:20,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193887356] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:20,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:20,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:55:20,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027647797] [2023-02-17 08:55:20,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:20,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:55:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:20,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:55:20,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:55:20,990 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 08:55:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:21,056 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2023-02-17 08:55:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:55:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2023-02-17 08:55:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:21,060 INFO L225 Difference]: With dead ends: 75 [2023-02-17 08:55:21,060 INFO L226 Difference]: Without dead ends: 75 [2023-02-17 08:55:21,063 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-17 08:55:21,065 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:21,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:55:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-17 08:55:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-17 08:55:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.711111111111111) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-02-17 08:55:21,078 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 7 [2023-02-17 08:55:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:21,078 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-02-17 08:55:21,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 08:55:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-02-17 08:55:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:55:21,082 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:21,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:21,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 08:55:21,082 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:21,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:21,086 INFO L85 PathProgramCache]: Analyzing trace with hash 649951808, now seen corresponding path program 1 times [2023-02-17 08:55:21,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:21,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424884985] [2023-02-17 08:55:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:21,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:21,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:21,212 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-17 08:55:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:21,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424884985] [2023-02-17 08:55:21,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424884985] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:21,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:21,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:55:21,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449915858] [2023-02-17 08:55:21,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:21,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:55:21,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:21,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:55:21,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:55:21,215 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-17 08:55:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:21,330 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-02-17 08:55:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:55:21,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-17 08:55:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:21,333 INFO L225 Difference]: With dead ends: 79 [2023-02-17 08:55:21,333 INFO L226 Difference]: Without dead ends: 79 [2023-02-17 08:55:21,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-17 08:55:21,334 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 11 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:21,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:55:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-17 08:55:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2023-02-17 08:55:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-17 08:55:21,339 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 13 [2023-02-17 08:55:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:21,340 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-17 08:55:21,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-17 08:55:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-17 08:55:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:55:21,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:21,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:21,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 08:55:21,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash 649951809, now seen corresponding path program 1 times [2023-02-17 08:55:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:21,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739800405] [2023-02-17 08:55:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:21,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:21,526 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-17 08:55:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:21,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739800405] [2023-02-17 08:55:21,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739800405] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:21,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:21,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:55:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448916878] [2023-02-17 08:55:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:21,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:55:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:55:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:55:21,530 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-17 08:55:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:21,664 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2023-02-17 08:55:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:55:21,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-17 08:55:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:21,666 INFO L225 Difference]: With dead ends: 78 [2023-02-17 08:55:21,667 INFO L226 Difference]: Without dead ends: 78 [2023-02-17 08:55:21,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-17 08:55:21,673 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:21,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 309 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:55:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-17 08:55:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2023-02-17 08:55:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 69 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2023-02-17 08:55:21,687 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 13 [2023-02-17 08:55:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:21,688 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2023-02-17 08:55:21,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-17 08:55:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2023-02-17 08:55:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 08:55:21,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:21,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:21,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 08:55:21,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash 87749440, now seen corresponding path program 1 times [2023-02-17 08:55:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:21,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871695570] [2023-02-17 08:55:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 08:55:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:21,754 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-17 08:55:21,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:21,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871695570] [2023-02-17 08:55:21,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871695570] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:21,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:21,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:55:21,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445539679] [2023-02-17 08:55:21,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:21,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:55:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:21,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:55:21,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:55:21,756 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-17 08:55:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:21,798 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2023-02-17 08:55:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:55:21,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2023-02-17 08:55:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:21,799 INFO L225 Difference]: With dead ends: 79 [2023-02-17 08:55:21,799 INFO L226 Difference]: Without dead ends: 79 [2023-02-17 08:55:21,799 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-17 08:55:21,800 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:21,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:55:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-17 08:55:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2023-02-17 08:55:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-17 08:55:21,813 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 15 [2023-02-17 08:55:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:21,813 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-17 08:55:21,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-17 08:55:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-17 08:55:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 08:55:21,814 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:21,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:21,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 08:55:21,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:21,815 INFO L85 PathProgramCache]: Analyzing trace with hash -847170750, now seen corresponding path program 1 times [2023-02-17 08:55:21,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:21,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770909555] [2023-02-17 08:55:21,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:21,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-17 08:55:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 08:55:21,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:21,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770909555] [2023-02-17 08:55:21,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770909555] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:21,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338058864] [2023-02-17 08:55:21,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:21,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:21,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:55:21,910 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-17 08:55:21,911 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-17 08:55:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:22,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 08:55:22,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:55:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:55:22,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:55:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 08:55:22,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338058864] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:55:22,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:55:22,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-17 08:55:22,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156438131] [2023-02-17 08:55:22,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:55:22,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:55:22,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:22,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:55:22,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:55:22,103 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 08:55:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:22,155 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-17 08:55:22,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:55:22,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-02-17 08:55:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:22,157 INFO L225 Difference]: With dead ends: 80 [2023-02-17 08:55:22,157 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 08:55:22,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:55:22,158 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:22,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 255 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:55:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 08:55:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-17 08:55:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.588235294117647) internal successors, (81), 75 states have internal predecessors, (81), 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-17 08:55:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-02-17 08:55:22,166 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 28 [2023-02-17 08:55:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:22,166 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-02-17 08:55:22,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 08:55:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-02-17 08:55:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 08:55:22,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:22,167 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:22,175 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-17 08:55:22,372 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-17 08:55:22,373 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:22,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281600, now seen corresponding path program 2 times [2023-02-17 08:55:22,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:22,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508496195] [2023-02-17 08:55:22,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:22,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:22,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:22,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 08:55:22,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:22,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508496195] [2023-02-17 08:55:22,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508496195] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:22,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:22,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:55:22,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234549727] [2023-02-17 08:55:22,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:22,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:55:22,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:22,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:55:22,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:55:22,820 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:22,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:22,934 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2023-02-17 08:55:22,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:55:22,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2023-02-17 08:55:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:22,935 INFO L225 Difference]: With dead ends: 88 [2023-02-17 08:55:22,935 INFO L226 Difference]: Without dead ends: 88 [2023-02-17 08:55:22,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:55:22,936 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:22,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 136 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:55:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-17 08:55:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2023-02-17 08:55:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 71 states have internal predecessors, (77), 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-17 08:55:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2023-02-17 08:55:22,945 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 41 [2023-02-17 08:55:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:22,947 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2023-02-17 08:55:22,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2023-02-17 08:55:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 08:55:22,949 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:22,949 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:22,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 08:55:22,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:22,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281601, now seen corresponding path program 1 times [2023-02-17 08:55:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:22,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998718089] [2023-02-17 08:55:22,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:22,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:23,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:23,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:23,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-17 08:55:23,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:23,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998718089] [2023-02-17 08:55:23,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998718089] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:23,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009463618] [2023-02-17 08:55:23,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:23,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:23,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:55:23,383 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-17 08:55:23,385 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-17 08:55:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:23,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 08:55:23,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:55:23,520 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-17 08:55:23,538 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-17 08:55:23,568 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-17 08:55:23,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:23,613 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-17 08:55:23,625 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-17 08:55:23,630 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_453 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-17 08:55:23,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:23,658 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-17 08:55:23,672 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-17 08:55:23,675 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_454 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454))))) is different from true [2023-02-17 08:55:23,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:23,686 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-17 08:55:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2023-02-17 08:55:23,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:55:23,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009463618] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:23,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:55:23,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-02-17 08:55:23,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757392063] [2023-02-17 08:55:23,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:55:23,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 08:55:23,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:23,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 08:55:23,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=192, Unknown=3, NotChecked=90, Total=342 [2023-02-17 08:55:23,734 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 17 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:55:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:23,891 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2023-02-17 08:55:23,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:55:23,892 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2023-02-17 08:55:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:23,892 INFO L225 Difference]: With dead ends: 84 [2023-02-17 08:55:23,892 INFO L226 Difference]: Without dead ends: 84 [2023-02-17 08:55:23,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=234, Unknown=3, NotChecked=102, Total=420 [2023-02-17 08:55:23,893 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 220 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:23,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 189 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 0 Unknown, 237 Unchecked, 0.1s Time] [2023-02-17 08:55:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-17 08:55:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2023-02-17 08:55:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 67 states have internal predecessors, (73), 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-17 08:55:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-02-17 08:55:23,895 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 41 [2023-02-17 08:55:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:23,895 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-02-17 08:55:23,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:55:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-02-17 08:55:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 08:55:23,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:23,896 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:23,904 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-17 08:55:24,096 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,SelfDestructingSolverStorable7 [2023-02-17 08:55:24,097 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526433, now seen corresponding path program 1 times [2023-02-17 08:55:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:24,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087063827] [2023-02-17 08:55:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:24,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 08:55:24,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:24,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087063827] [2023-02-17 08:55:24,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087063827] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:24,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703483088] [2023-02-17 08:55:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:24,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:24,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:55:24,459 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-17 08:55:24,484 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-17 08:55:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:24,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-17 08:55:24,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:55:24,663 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-17 08:55:24,719 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_614 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_614))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-17 08:55:24,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:24,736 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-17 08:55:24,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:24,740 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 44 [2023-02-17 08:55:24,788 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 84 treesize of output 60 [2023-02-17 08:55:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 08:55:24,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:55:24,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703483088] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:24,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:55:24,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-17 08:55:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924573135] [2023-02-17 08:55:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:24,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:55:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:24,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:55:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-17 08:55:24,797 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:25,005 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-02-17 08:55:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 08:55:25,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-02-17 08:55:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:25,006 INFO L225 Difference]: With dead ends: 112 [2023-02-17 08:55:25,006 INFO L226 Difference]: Without dead ends: 112 [2023-02-17 08:55:25,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2023-02-17 08:55:25,007 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 73 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:25,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 298 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 3 Unknown, 132 Unchecked, 0.2s Time] [2023-02-17 08:55:25,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-17 08:55:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2023-02-17 08:55:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 69 states have internal predecessors, (77), 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-17 08:55:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-02-17 08:55:25,009 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 44 [2023-02-17 08:55:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:25,009 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-02-17 08:55:25,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-02-17 08:55:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 08:55:25,009 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:25,010 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:25,017 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-17 08:55:25,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:25,210 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526434, now seen corresponding path program 1 times [2023-02-17 08:55:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:25,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669528866] [2023-02-17 08:55:25,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:25,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:25,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:25,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 08:55:25,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:25,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669528866] [2023-02-17 08:55:25,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669528866] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:25,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291088885] [2023-02-17 08:55:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:25,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:25,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:55:25,694 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-17 08:55:25,696 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-17 08:55:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:25,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-17 08:55:25,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:55:25,925 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 27 treesize of output 19 [2023-02-17 08:55:25,929 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-17 08:55:25,989 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_772)) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (<= |node_create_~temp~0#1.base| (+ |c_#StackHeapBarrier| (- 1))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_773)))) is different from true [2023-02-17 08:55:26,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:26,011 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 33 treesize of output 33 [2023-02-17 08:55:26,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:26,016 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 33 treesize of output 33 [2023-02-17 08:55:26,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:26,020 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 26 treesize of output 21 [2023-02-17 08:55:26,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:26,023 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 19 [2023-02-17 08:55:26,044 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 17 [2023-02-17 08:55:26,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 30 treesize of output 18 [2023-02-17 08:55:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 08:55:26,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:55:26,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291088885] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:26,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:55:26,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 27 [2023-02-17 08:55:26,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765560755] [2023-02-17 08:55:26,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:26,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:55:26,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:26,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:55:26,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=630, Unknown=1, NotChecked=50, Total=756 [2023-02-17 08:55:26,081 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:26,408 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2023-02-17 08:55:26,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 08:55:26,408 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-02-17 08:55:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:26,409 INFO L225 Difference]: With dead ends: 113 [2023-02-17 08:55:26,409 INFO L226 Difference]: Without dead ends: 113 [2023-02-17 08:55:26,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=999, Unknown=1, NotChecked=64, Total=1190 [2023-02-17 08:55:26,410 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 167 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:26,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 321 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 377 Invalid, 0 Unknown, 107 Unchecked, 0.2s Time] [2023-02-17 08:55:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-17 08:55:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 74. [2023-02-17 08:55:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 69 states have internal predecessors, (76), 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-17 08:55:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-02-17 08:55:26,412 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 44 [2023-02-17 08:55:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:26,412 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-02-17 08:55:26,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-02-17 08:55:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 08:55:26,412 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:26,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:26,424 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-17 08:55:26,617 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-17 08:55:26,617 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash 91710248, now seen corresponding path program 1 times [2023-02-17 08:55:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:26,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342360269] [2023-02-17 08:55:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 08:55:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:26,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342360269] [2023-02-17 08:55:26,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342360269] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:26,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:26,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:55:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626832152] [2023-02-17 08:55:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:26,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:55:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:26,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:55:26,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:55:26,684 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:55:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:26,724 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-02-17 08:55:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:55:26,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-02-17 08:55:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:26,725 INFO L225 Difference]: With dead ends: 109 [2023-02-17 08:55:26,725 INFO L226 Difference]: Without dead ends: 109 [2023-02-17 08:55:26,725 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-17 08:55:26,726 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:26,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:55:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-17 08:55:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2023-02-17 08:55:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 70 states have internal predecessors, (77), 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-17 08:55:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-17 08:55:26,728 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2023-02-17 08:55:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:26,728 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-17 08:55:26,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:55:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-17 08:55:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:55:26,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:26,729 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:26,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 08:55:26,730 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:26,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944619, now seen corresponding path program 1 times [2023-02-17 08:55:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:26,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63443697] [2023-02-17 08:55:26,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-17 08:55:26,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:26,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63443697] [2023-02-17 08:55:26,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63443697] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:26,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:26,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:55:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366312802] [2023-02-17 08:55:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:26,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:55:26,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:26,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:55:26,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:55:26,811 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-17 08:55:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:26,885 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-02-17 08:55:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:55:26,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 46 [2023-02-17 08:55:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:26,886 INFO L225 Difference]: With dead ends: 86 [2023-02-17 08:55:26,887 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 08:55:26,887 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-17 08:55:26,887 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:26,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 207 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:55:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 08:55:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2023-02-17 08:55:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 69 states have internal predecessors, (76), 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-17 08:55:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-02-17 08:55:26,891 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 46 [2023-02-17 08:55:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:26,891 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-02-17 08:55:26,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-17 08:55:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-02-17 08:55:26,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:55:26,893 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:26,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:26,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 08:55:26,893 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944618, now seen corresponding path program 1 times [2023-02-17 08:55:26,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:26,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646817387] [2023-02-17 08:55:26,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 08:55:26,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:26,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646817387] [2023-02-17 08:55:26,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646817387] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:26,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:26,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:55:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700662401] [2023-02-17 08:55:26,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:26,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:55:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:55:26,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:55:26,982 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:27,018 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2023-02-17 08:55:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:55:27,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2023-02-17 08:55:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:27,019 INFO L225 Difference]: With dead ends: 73 [2023-02-17 08:55:27,019 INFO L226 Difference]: Without dead ends: 73 [2023-02-17 08:55:27,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-17 08:55:27,020 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:27,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 160 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:55:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-17 08:55:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-17 08:55:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 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-17 08:55:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2023-02-17 08:55:27,023 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 46 [2023-02-17 08:55:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:27,023 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2023-02-17 08:55:27,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2023-02-17 08:55:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 08:55:27,025 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:27,025 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:27,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-17 08:55:27,026 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:27,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2059192403, now seen corresponding path program 1 times [2023-02-17 08:55:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:27,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137328755] [2023-02-17 08:55:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 08:55:27,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:27,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137328755] [2023-02-17 08:55:27,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137328755] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:27,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:27,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:55:27,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69980324] [2023-02-17 08:55:27,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:27,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:55:27,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:27,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:55:27,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:55:27,153 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:27,190 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2023-02-17 08:55:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:55:27,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2023-02-17 08:55:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:27,191 INFO L225 Difference]: With dead ends: 70 [2023-02-17 08:55:27,191 INFO L226 Difference]: Without dead ends: 70 [2023-02-17 08:55:27,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:55:27,192 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 91 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:27,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 138 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:55:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-17 08:55:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-17 08:55:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 65 states have internal predecessors, (70), 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-17 08:55:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2023-02-17 08:55:27,194 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 47 [2023-02-17 08:55:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:27,194 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2023-02-17 08:55:27,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:55:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2023-02-17 08:55:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 08:55:27,196 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:27,196 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:27,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-17 08:55:27,196 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:27,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:27,197 INFO L85 PathProgramCache]: Analyzing trace with hash 589543324, now seen corresponding path program 1 times [2023-02-17 08:55:27,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:27,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530406965] [2023-02-17 08:55:27,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 08:55:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:27,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530406965] [2023-02-17 08:55:27,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530406965] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:27,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:27,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:55:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565366585] [2023-02-17 08:55:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:27,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:55:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:55:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:55:27,254 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:55:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:27,301 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-02-17 08:55:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:55:27,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-02-17 08:55:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:27,302 INFO L225 Difference]: With dead ends: 81 [2023-02-17 08:55:27,302 INFO L226 Difference]: Without dead ends: 81 [2023-02-17 08:55:27,304 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-17 08:55:27,304 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:27,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 140 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:55:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-17 08:55:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2023-02-17 08:55:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 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-17 08:55:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-02-17 08:55:27,307 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 48 [2023-02-17 08:55:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:27,307 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-02-17 08:55:27,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:55:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-02-17 08:55:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 08:55:27,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:27,308 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:27,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-17 08:55:27,308 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:27,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:27,308 INFO L85 PathProgramCache]: Analyzing trace with hash 589543325, now seen corresponding path program 1 times [2023-02-17 08:55:27,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:27,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54499413] [2023-02-17 08:55:27,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 08:55:27,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:27,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54499413] [2023-02-17 08:55:27,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54499413] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:27,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:27,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:55:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164540542] [2023-02-17 08:55:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:27,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:55:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:27,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:55:27,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:55:27,387 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:55:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:27,441 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2023-02-17 08:55:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:55:27,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-02-17 08:55:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:27,442 INFO L225 Difference]: With dead ends: 68 [2023-02-17 08:55:27,442 INFO L226 Difference]: Without dead ends: 68 [2023-02-17 08:55:27,442 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-17 08:55:27,442 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 39 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:27,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 137 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:55:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-17 08:55:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-02-17 08:55:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 63 states have internal predecessors, (68), 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-17 08:55:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-02-17 08:55:27,445 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 48 [2023-02-17 08:55:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:27,446 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-02-17 08:55:27,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:55:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-02-17 08:55:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 08:55:27,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:27,446 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:27,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-17 08:55:27,447 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1095973890, now seen corresponding path program 1 times [2023-02-17 08:55:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:27,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212288159] [2023-02-17 08:55:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:55:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:27,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212288159] [2023-02-17 08:55:27,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212288159] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:55:27,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:55:27,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:55:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591001512] [2023-02-17 08:55:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:55:27,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:55:27,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:55:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:55:27,581 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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-17 08:55:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:27,650 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2023-02-17 08:55:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:55:27,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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 49 [2023-02-17 08:55:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:27,652 INFO L225 Difference]: With dead ends: 67 [2023-02-17 08:55:27,652 INFO L226 Difference]: Without dead ends: 67 [2023-02-17 08:55:27,653 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-17 08:55:27,654 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:27,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 206 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:55:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-17 08:55:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-17 08:55:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 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-17 08:55:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2023-02-17 08:55:27,657 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 49 [2023-02-17 08:55:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:27,657 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2023-02-17 08:55:27,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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-17 08:55:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2023-02-17 08:55:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-17 08:55:27,658 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:27,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:27,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 08:55:27,658 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash 15214980, now seen corresponding path program 1 times [2023-02-17 08:55:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:27,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603854370] [2023-02-17 08:55:27,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:27,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:28,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 08:55:28,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:28,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603854370] [2023-02-17 08:55:28,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603854370] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:28,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042921617] [2023-02-17 08:55:28,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:28,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:28,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:55:28,148 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-17 08:55:28,159 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-17 08:55:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:28,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-17 08:55:28,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:55:28,462 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 12 treesize of output 8 [2023-02-17 08:55:28,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:28,569 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-17 08:55:28,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:28,718 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 31 treesize of output 46 [2023-02-17 08:55:28,722 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 38 treesize of output 28 [2023-02-17 08:55:28,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:28,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:28,755 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 62 treesize of output 84 [2023-02-17 08:55:28,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:28,797 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 174 treesize of output 149 [2023-02-17 08:55:28,805 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 92 treesize of output 80 [2023-02-17 08:55:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 08:55:28,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:55:28,833 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1659 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1659) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-17 08:55:28,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:28,906 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 26 [2023-02-17 08:55:29,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_11| Int)) (or (forall ((v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1658 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1658) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_11| v_ArrVal_1659) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0))) (not (<= |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_11| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)))) is different from false [2023-02-17 08:55:29,083 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1658 (Array Int Int)) (v_ArrVal_1663 (Array Int Int)) (|v_node_create_~temp~0#1.base_22| Int) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_11| Int)) (or (not (< |v_node_create_~temp~0#1.base_22| |c_#StackHeapBarrier|)) (< |v_node_create_~temp~0#1.base_22| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_11|) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_22| v_ArrVal_1663))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (= (select (select (store (store .cse0 .cse1 v_ArrVal_1658) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_11| v_ArrVal_1659) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1))))) is different from false [2023-02-17 08:55:29,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042921617] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:29,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:55:29,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 39 [2023-02-17 08:55:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37692429] [2023-02-17 08:55:29,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:55:29,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-17 08:55:29,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:29,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-17 08:55:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1783, Unknown=57, NotChecked=264, Total=2256 [2023-02-17 08:55:29,087 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 40 states, 37 states have (on average 2.081081081081081) internal successors, (77), 34 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 08:55:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:29,830 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2023-02-17 08:55:29,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 08:55:29,831 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.081081081081081) internal successors, (77), 34 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2023-02-17 08:55:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:29,832 INFO L225 Difference]: With dead ends: 129 [2023-02-17 08:55:29,832 INFO L226 Difference]: Without dead ends: 129 [2023-02-17 08:55:29,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=521, Invalid=3466, Unknown=57, NotChecked=378, Total=4422 [2023-02-17 08:55:29,834 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 697 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:29,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 533 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:55:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-17 08:55:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 72. [2023-02-17 08:55:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 67 states have internal predecessors, (74), 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-17 08:55:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2023-02-17 08:55:29,836 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 54 [2023-02-17 08:55:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:29,836 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2023-02-17 08:55:29,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.081081081081081) internal successors, (77), 34 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 08:55:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2023-02-17 08:55:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-17 08:55:29,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:29,837 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:29,845 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-17 08:55:30,043 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,SelfDestructingSolverStorable17 [2023-02-17 08:55:30,043 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash 15214981, now seen corresponding path program 1 times [2023-02-17 08:55:30,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:30,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206851211] [2023-02-17 08:55:30,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:30,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:30,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:30,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 08:55:30,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:30,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206851211] [2023-02-17 08:55:30,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206851211] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:30,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687020698] [2023-02-17 08:55:30,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:30,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:30,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:55:30,691 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-17 08:55:30,693 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-17 08:55:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:30,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-17 08:55:30,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:55:30,907 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-17 08:55:30,910 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-17 08:55:31,111 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-17 08:55:31,115 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-17 08:55:31,118 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-17 08:55:31,121 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-17 08:55:31,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:31,284 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 36 treesize of output 34 [2023-02-17 08:55:31,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:31,289 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 19 [2023-02-17 08:55:31,292 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 18 [2023-02-17 08:55:31,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:31,295 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-17 08:55:31,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:31,460 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 49 treesize of output 60 [2023-02-17 08:55:31,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:31,464 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 16 treesize of output 18 [2023-02-17 08:55:31,466 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 44 treesize of output 32 [2023-02-17 08:55:31,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:31,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:31,516 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 74 treesize of output 94 [2023-02-17 08:55:31,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:31,524 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-17 08:55:31,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:31,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 219 treesize of output 210 [2023-02-17 08:55:31,628 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-17 08:55:31,712 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 133 treesize of output 113 [2023-02-17 08:55:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 08:55:31,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:55:31,815 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int))) (<= (+ 4 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1851) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1851 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1851) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-17 08:55:32,261 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (and (forall ((v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1850) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1851) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (<= (+ 4 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1850) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1851) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1849) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1852) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-17 08:55:32,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687020698] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:32,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:55:32,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2023-02-17 08:55:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368411132] [2023-02-17 08:55:32,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:55:32,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-17 08:55:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-17 08:55:32,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2352, Unknown=29, NotChecked=198, Total=2756 [2023-02-17 08:55:32,376 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 43 states, 40 states have (on average 2.125) internal successors, (85), 37 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 08:55:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:33,539 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2023-02-17 08:55:33,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-17 08:55:33,540 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 2.125) internal successors, (85), 37 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2023-02-17 08:55:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:33,540 INFO L225 Difference]: With dead ends: 119 [2023-02-17 08:55:33,540 INFO L226 Difference]: Without dead ends: 119 [2023-02-17 08:55:33,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=463, Invalid=4344, Unknown=31, NotChecked=274, Total=5112 [2023-02-17 08:55:33,542 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 734 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:33,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 783 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1162 Invalid, 2 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 08:55:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-17 08:55:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2023-02-17 08:55:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.25) internal successors, (75), 69 states have internal predecessors, (75), 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-17 08:55:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2023-02-17 08:55:33,544 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 54 [2023-02-17 08:55:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:33,544 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2023-02-17 08:55:33,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 2.125) internal successors, (85), 37 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 08:55:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2023-02-17 08:55:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-17 08:55:33,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:33,545 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:55:33,553 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-17 08:55:33,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:33,751 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:33,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash 281883172, now seen corresponding path program 1 times [2023-02-17 08:55:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:33,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534344265] [2023-02-17 08:55:33,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:33,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 08:55:34,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:34,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534344265] [2023-02-17 08:55:34,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534344265] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:34,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559085297] [2023-02-17 08:55:34,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:34,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:34,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:55:34,026 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-17 08:55:34,028 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-17 08:55:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:34,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 08:55:34,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:55:34,203 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-17 08:55:34,216 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2043 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2043))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-17 08:55:34,225 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-17 08:55:34,238 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2044 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2044))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-17 08:55:34,243 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-17 08:55:34,246 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2045 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2045))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-17 08:55:34,252 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-17 08:55:34,263 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-17 08:55:34,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:34,275 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 15 [2023-02-17 08:55:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2023-02-17 08:55:34,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:55:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 08:55:34,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559085297] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:55:34,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:55:34,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 7] total 30 [2023-02-17 08:55:34,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226516408] [2023-02-17 08:55:34,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:55:34,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-17 08:55:34,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:34,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-17 08:55:34,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=623, Unknown=3, NotChecked=156, Total=870 [2023-02-17 08:55:34,551 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 27 states have internal predecessors, (104), 4 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-17 08:55:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:34,981 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2023-02-17 08:55:34,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 08:55:34,982 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 27 states have internal predecessors, (104), 4 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2023-02-17 08:55:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:34,982 INFO L225 Difference]: With dead ends: 69 [2023-02-17 08:55:34,983 INFO L226 Difference]: Without dead ends: 69 [2023-02-17 08:55:34,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 91 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=334, Invalid=1567, Unknown=3, NotChecked=258, Total=2162 [2023-02-17 08:55:34,983 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 369 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:34,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 381 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 528 Invalid, 0 Unknown, 186 Unchecked, 0.2s Time] [2023-02-17 08:55:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-17 08:55:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-17 08:55:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 64 states have internal predecessors, (69), 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-17 08:55:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-02-17 08:55:34,986 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 54 [2023-02-17 08:55:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:34,986 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-02-17 08:55:34,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.586206896551724) internal successors, (104), 27 states have internal predecessors, (104), 4 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-17 08:55:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-02-17 08:55:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-17 08:55:34,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:34,987 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-17 08:55:34,992 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-17 08:55:35,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:35,193 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:35,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash 471663079, now seen corresponding path program 1 times [2023-02-17 08:55:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:35,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379853975] [2023-02-17 08:55:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:35,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 08:55:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:35,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379853975] [2023-02-17 08:55:35,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379853975] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:35,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217317191] [2023-02-17 08:55:35,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:35,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:35,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:55:35,740 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-17 08:55:35,742 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-17 08:55:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:35,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-17 08:55:35,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:55:36,099 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 16 treesize of output 8 [2023-02-17 08:55:36,139 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2233 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2233))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-17 08:55:36,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2234 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2234))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-17 08:55:36,156 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2234 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2234))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-17 08:55:36,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:36,161 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 26 treesize of output 26 [2023-02-17 08:55:36,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:36,310 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 45 [2023-02-17 08:55:36,314 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 21 treesize of output 15 [2023-02-17 08:55:36,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:36,356 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 48 treesize of output 48 [2023-02-17 08:55:36,389 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 49 treesize of output 37 [2023-02-17 08:55:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2023-02-17 08:55:36,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:55:39,045 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_19| Int) (v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int))) (or (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_19| v_ArrVal_2235) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2236) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (<= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_19| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|)))) is different from false [2023-02-17 08:55:39,199 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_19| Int) (v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2240 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_2240))) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (<= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_19| (select (select .cse0 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (not (= 0 (select (select (store (store .cse0 |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_19| v_ArrVal_2235) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_2236) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-17 08:55:39,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217317191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:39,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:55:39,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2023-02-17 08:55:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700437278] [2023-02-17 08:55:39,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:55:39,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-17 08:55:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:55:39,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-17 08:55:39,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1866, Unknown=61, NotChecked=460, Total=2550 [2023-02-17 08:55:39,202 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 44 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 38 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 08:55:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:55:40,159 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2023-02-17 08:55:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 08:55:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 38 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2023-02-17 08:55:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:55:40,160 INFO L225 Difference]: With dead ends: 72 [2023-02-17 08:55:40,161 INFO L226 Difference]: Without dead ends: 72 [2023-02-17 08:55:40,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=494, Invalid=3496, Unknown=62, NotChecked=640, Total=4692 [2023-02-17 08:55:40,162 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 612 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:55:40,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 640 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 849 Invalid, 0 Unknown, 219 Unchecked, 0.5s Time] [2023-02-17 08:55:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-17 08:55:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2023-02-17 08:55:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 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-17 08:55:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2023-02-17 08:55:40,164 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2023-02-17 08:55:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:55:40,164 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2023-02-17 08:55:40,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 38 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 08:55:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2023-02-17 08:55:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-17 08:55:40,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:55:40,165 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-17 08:55:40,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-17 08:55:40,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-17 08:55:40,371 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-17 08:55:40,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:55:40,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1777907541, now seen corresponding path program 1 times [2023-02-17 08:55:40,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:55:40,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122280839] [2023-02-17 08:55:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:40,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:55:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 08:55:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:41,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 08:55:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:41,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-17 08:55:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 08:55:41,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:55:41,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122280839] [2023-02-17 08:55:41,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122280839] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:55:41,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447934322] [2023-02-17 08:55:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:55:41,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:55:41,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:55:41,359 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-17 08:55:41,361 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-17 08:55:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:55:41,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 120 conjunts are in the unsatisfiable core [2023-02-17 08:55:41,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:55:41,585 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-17 08:55:41,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:41,702 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 21 treesize of output 20 [2023-02-17 08:55:41,850 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-17 08:55:41,853 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-17 08:55:41,856 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-17 08:55:41,858 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-17 08:55:42,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:42,089 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-17 08:55:42,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:42,093 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 36 [2023-02-17 08:55:42,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:42,097 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 46 [2023-02-17 08:55:42,100 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-17 08:55:42,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:42,104 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 19 [2023-02-17 08:55:42,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:42,349 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 119 treesize of output 118 [2023-02-17 08:55:42,355 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2023-02-17 08:55:42,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:42,359 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2023-02-17 08:55:42,365 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 24 treesize of output 30 [2023-02-17 08:55:42,371 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 99 treesize of output 77 [2023-02-17 08:55:42,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:42,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:42,473 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 184 treesize of output 194 [2023-02-17 08:55:42,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:42,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:42,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 217 [2023-02-17 08:55:42,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:55:42,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:42,489 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 206 [2023-02-17 08:55:42,513 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-17 08:55:42,516 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,521 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-17 08:55:42,523 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,524 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,527 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,552 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,554 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,554 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,556 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,556 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,558 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,558 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,559 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,563 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,567 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,568 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,569 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,570 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:42,571 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 08:55:43,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:43,061 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 2134 treesize of output 1713 [2023-02-17 08:55:43,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:43,068 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 1709 treesize of output 1595 [2023-02-17 08:55:43,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2506 treesize of output 2394 [2023-02-17 08:55:43,309 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 2264 treesize of output 1886 [2023-02-17 08:55:45,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:55:45,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 63 select indices, 63 select index equivalence classes, 0 disjoint index pairs (out of 1953 index pairs), introduced 63 new quantified variables, introduced 1953 case distinctions, treesize of input 1890 treesize of output 17218