./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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_append_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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:28:33,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:28:33,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:28:33,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:28:33,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:28:33,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:28:33,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:28:33,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:28:33,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:28:33,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:28:33,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:28:33,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:28:33,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:28:33,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:28:33,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:28:33,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:28:33,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:28:33,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:28:33,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:28:33,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:28:33,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:28:33,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:28:33,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:28:33,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:28:33,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:28:33,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:28:33,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:28:33,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:28:33,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:28:33,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:28:33,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:28:33,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:28:33,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:28:33,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:28:33,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:28:33,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:28:33,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:28:33,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:28:33,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:28:33,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:28:33,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:28:33,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:28:33,837 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:28:33,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:28:33,839 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:28:33,839 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:28:33,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:28:33,840 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:28:33,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:28:33,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:28:33,841 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:28:33,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:28:33,842 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:28:33,842 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:28:33,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:28:33,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:28:33,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:28:33,843 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:28:33,843 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:28:33,843 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:28:33,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:28:33,843 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:28:33,843 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:28:33,843 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:28:33,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:28:33,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:28:33,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:28:33,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:28:33,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:28:33,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:28:33,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:28:33,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:28:33,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:28:33,845 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:28:33,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:28:33,845 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:28:33,845 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-02-15 22:28:34,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:28:34,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:28:34,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:28:34,058 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:28:34,058 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:28:34,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-15 22:28:35,078 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:28:35,304 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:28:35,305 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-15 22:28:35,311 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9612258b6/c8d7e08b9eec4166ae6c3a61036e5b06/FLAGb8f024e8b [2023-02-15 22:28:35,324 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9612258b6/c8d7e08b9eec4166ae6c3a61036e5b06 [2023-02-15 22:28:35,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:28:35,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:28:35,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:28:35,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:28:35,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:28:35,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585c8944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35, skipping insertion in model container [2023-02-15 22:28:35,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:28:35,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:28:35,535 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_append_equal.i[24197,24210] [2023-02-15 22:28:35,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:28:35,569 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:28:35,615 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_append_equal.i[24197,24210] [2023-02-15 22:28:35,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:28:35,640 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:28:35,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35 WrapperNode [2023-02-15 22:28:35,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:28:35,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:28:35,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:28:35,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:28:35,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,682 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-02-15 22:28:35,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:28:35,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:28:35,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:28:35,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:28:35,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,718 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:28:35,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:28:35,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:28:35,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:28:35,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (1/1) ... [2023-02-15 22:28:35,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:28:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:35,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:28:35,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:28:35,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:28:35,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:28:35,817 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 22:28:35,817 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 22:28:35,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:28:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:28:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:28:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:28:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:28:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:28:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:28:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:28:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:28:35,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:28:35,895 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:28:35,897 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:28:36,151 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:28:36,159 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:28:36,166 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 22:28:36,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:28:36 BoogieIcfgContainer [2023-02-15 22:28:36,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:28:36,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:28:36,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:28:36,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:28:36,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:28:35" (1/3) ... [2023-02-15 22:28:36,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f22bbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:28:36, skipping insertion in model container [2023-02-15 22:28:36,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:35" (2/3) ... [2023-02-15 22:28:36,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f22bbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:28:36, skipping insertion in model container [2023-02-15 22:28:36,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:28:36" (3/3) ... [2023-02-15 22:28:36,175 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-02-15 22:28:36,187 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:28:36,188 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-02-15 22:28:36,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:28:36,242 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;@52a1ddf9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:28:36,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-02-15 22:28:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 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-15 22:28:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:28:36,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:36,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:36,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:36,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:36,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904761, now seen corresponding path program 1 times [2023-02-15 22:28:36,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:36,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236413671] [2023-02-15 22:28:36,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:36,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:36,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:36,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236413671] [2023-02-15 22:28:36,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236413671] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:36,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:36,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:28:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602724502] [2023-02-15 22:28:36,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:36,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:28:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:36,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:28:36,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:28:36,534 INFO L87 Difference]: Start difference. First operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 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-15 22:28:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:36,617 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-02-15 22:28:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:28:36,619 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-15 22:28:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:36,624 INFO L225 Difference]: With dead ends: 83 [2023-02-15 22:28:36,624 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 22:28:36,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:28:36,628 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:36,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 22:28:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-15 22:28:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 76 states have internal predecessors, (82), 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-15 22:28:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-02-15 22:28:36,652 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 7 [2023-02-15 22:28:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:36,652 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-02-15 22:28:36,652 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-15 22:28:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-02-15 22:28:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:28:36,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:36,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:36,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:28:36,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904762, now seen corresponding path program 1 times [2023-02-15 22:28:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:36,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409010774] [2023-02-15 22:28:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:36,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:36,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:36,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409010774] [2023-02-15 22:28:36,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409010774] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:36,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:36,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:28:36,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084121187] [2023-02-15 22:28:36,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:36,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:28:36,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:36,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:28:36,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:28:36,767 INFO L87 Difference]: Start difference. First operand 80 states and 86 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-15 22:28:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:36,809 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-02-15 22:28:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:28:36,809 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-15 22:28:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:36,810 INFO L225 Difference]: With dead ends: 78 [2023-02-15 22:28:36,810 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 22:28:36,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:28:36,812 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:36,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:28:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 22:28:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-15 22:28:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 74 states have internal predecessors, (80), 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-15 22:28:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2023-02-15 22:28:36,817 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2023-02-15 22:28:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:36,818 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2023-02-15 22:28:36,818 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-15 22:28:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2023-02-15 22:28:36,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:28:36,818 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:36,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:36,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:28:36,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:36,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810752, now seen corresponding path program 1 times [2023-02-15 22:28:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:36,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711613707] [2023-02-15 22:28:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:36,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:36,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:36,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711613707] [2023-02-15 22:28:36,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711613707] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:36,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:36,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:28:36,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647152962] [2023-02-15 22:28:36,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:36,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:28:36,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:36,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:28:36,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:28:36,959 INFO L87 Difference]: Start difference. First operand 78 states and 84 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-15 22:28:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:37,082 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2023-02-15 22:28:37,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:28:37,083 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-15 22:28:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:37,085 INFO L225 Difference]: With dead ends: 82 [2023-02-15 22:28:37,085 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 22:28:37,085 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-15 22:28:37,086 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:37,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 22:28:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2023-02-15 22:28:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.7173913043478262) 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-15 22:28:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-15 22:28:37,092 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 13 [2023-02-15 22:28:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:37,092 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-15 22:28:37,093 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-15 22:28:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-15 22:28:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:28:37,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:37,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:37,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:28:37,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:37,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810753, now seen corresponding path program 1 times [2023-02-15 22:28:37,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:37,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318542425] [2023-02-15 22:28:37,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:37,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:37,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318542425] [2023-02-15 22:28:37,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318542425] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:37,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:37,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:28:37,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46696279] [2023-02-15 22:28:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:37,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:28:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:28:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:28:37,328 INFO L87 Difference]: Start difference. First operand 77 states and 83 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-15 22:28:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:37,447 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-02-15 22:28:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:28:37,448 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-15 22:28:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:37,449 INFO L225 Difference]: With dead ends: 81 [2023-02-15 22:28:37,449 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 22:28:37,450 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-15 22:28:37,455 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:37,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 316 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 22:28:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-02-15 22:28:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 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-15 22:28:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-02-15 22:28:37,469 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2023-02-15 22:28:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:37,469 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-02-15 22:28:37,469 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-15 22:28:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-02-15 22:28:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:28:37,470 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:37,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:37,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:28:37,471 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:37,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1399608384, now seen corresponding path program 1 times [2023-02-15 22:28:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:37,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757791126] [2023-02-15 22:28:37,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:37,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 22:28:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:37,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757791126] [2023-02-15 22:28:37,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757791126] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:37,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:37,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:28:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847395410] [2023-02-15 22:28:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:37,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:28:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:28:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:28:37,560 INFO L87 Difference]: Start difference. First operand 76 states and 82 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-15 22:28:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:37,616 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-02-15 22:28:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:28:37,616 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-15 22:28:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:37,617 INFO L225 Difference]: With dead ends: 82 [2023-02-15 22:28:37,617 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 22:28:37,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:28:37,618 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:37,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 192 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 22:28:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2023-02-15 22:28:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.6808510638297873) 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-15 22:28:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-15 22:28:37,622 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 15 [2023-02-15 22:28:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:37,622 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-15 22:28:37,622 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-15 22:28:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-15 22:28:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 22:28:37,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:37,623 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-15 22:28:37,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:28:37,623 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash -898428094, now seen corresponding path program 1 times [2023-02-15 22:28:37,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:37,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813871590] [2023-02-15 22:28:37,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:37,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 22:28:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,697 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-15 22:28:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:37,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813871590] [2023-02-15 22:28:37,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813871590] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:37,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429616159] [2023-02-15 22:28:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:37,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:37,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:37,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:37,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:28:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:37,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:28:37,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:37,858 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-15 22:28:37,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:37,890 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-15 22:28:37,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429616159] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:28:37,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:28:37,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 22:28:37,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857620688] [2023-02-15 22:28:37,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:37,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:28:37,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:37,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:28:37,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:28:37,892 INFO L87 Difference]: Start difference. First operand 77 states and 83 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-15 22:28:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:37,958 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-02-15 22:28:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:28:37,959 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-15 22:28:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:37,959 INFO L225 Difference]: With dead ends: 83 [2023-02-15 22:28:37,959 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 22:28:37,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:28:37,960 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:37,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 267 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 22:28:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-15 22:28:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:28:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2023-02-15 22:28:37,963 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 28 [2023-02-15 22:28:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:37,964 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2023-02-15 22:28:37,964 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-15 22:28:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2023-02-15 22:28:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:28:37,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:37,965 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-15 22:28:37,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 22:28:38,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 22:28:38,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186176, now seen corresponding path program 2 times [2023-02-15 22:28:38,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:38,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431684266] [2023-02-15 22:28:38,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:38,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:28:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:28:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:38,677 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-15 22:28:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:38,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431684266] [2023-02-15 22:28:38,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431684266] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:38,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:38,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:28:38,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262516971] [2023-02-15 22:28:38,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:38,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:28:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:38,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:28:38,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:28:38,680 INFO L87 Difference]: Start difference. First operand 83 states and 90 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-15 22:28:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:38,789 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2023-02-15 22:28:38,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:28:38,790 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-15 22:28:38,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:38,790 INFO L225 Difference]: With dead ends: 90 [2023-02-15 22:28:38,790 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 22:28:38,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:28:38,791 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 110 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:38,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 173 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 22:28:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-02-15 22:28:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:28:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-02-15 22:28:38,794 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 41 [2023-02-15 22:28:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:38,795 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-02-15 22:28:38,795 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-15 22:28:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-02-15 22:28:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:28:38,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:38,796 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-15 22:28:38,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:28:38,796 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186175, now seen corresponding path program 1 times [2023-02-15 22:28:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:38,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345094421] [2023-02-15 22:28:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:38,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:39,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:28:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:28:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:28:39,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:39,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345094421] [2023-02-15 22:28:39,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345094421] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:39,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935867986] [2023-02-15 22:28:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:39,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:39,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:39,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:39,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:28:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:39,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:28:39,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:39,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:28:39,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:28:39,502 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-15 22:28:39,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:39,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:28:39,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:28:39,574 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-15 22:28:39,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:39,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:28:39,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:28:39,659 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-15 22:28:39,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:39,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:28:39,705 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-15 22:28:39,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:39,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935867986] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:39,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:39,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2023-02-15 22:28:39,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816084905] [2023-02-15 22:28:39,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:39,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:28:39,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:39,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:28:39,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=287, Unknown=3, NotChecked=108, Total=462 [2023-02-15 22:28:39,785 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 20 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:28:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:40,114 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-02-15 22:28:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:28:40,114 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-02-15 22:28:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:40,115 INFO L225 Difference]: With dead ends: 85 [2023-02-15 22:28:40,115 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 22:28:40,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=451, Unknown=3, NotChecked=138, Total=702 [2023-02-15 22:28:40,116 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 378 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:40,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 178 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 230 Invalid, 0 Unknown, 237 Unchecked, 0.2s Time] [2023-02-15 22:28:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 22:28:40,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2023-02-15 22:28:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.4230769230769231) 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-15 22:28:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2023-02-15 22:28:40,119 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2023-02-15 22:28:40,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:40,120 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2023-02-15 22:28:40,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:28:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2023-02-15 22:28:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:28:40,121 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:40,121 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-15 22:28:40,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:40,326 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-15 22:28:40,326 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:40,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253767, now seen corresponding path program 1 times [2023-02-15 22:28:40,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:40,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625395805] [2023-02-15 22:28:40,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:40,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:40,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:28:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:28:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:41,068 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-15 22:28:41,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:41,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625395805] [2023-02-15 22:28:41,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625395805] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:41,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057286100] [2023-02-15 22:28:41,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:41,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:41,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:41,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:41,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:28:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:41,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-15 22:28:41,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:41,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 22:28:41,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:28:41,606 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_616)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_615)))) is different from true [2023-02-15 22:28:41,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:41,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 22:28:41,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:41,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:28:41,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:41,653 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 18 treesize of output 13 [2023-02-15 22:28:41,658 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:28:41,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:28:41,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:28:41,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:28:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-15 22:28:41,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:41,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057286100] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:41,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:41,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2023-02-15 22:28:41,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564145243] [2023-02-15 22:28:41,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:41,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 22:28:41,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:41,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 22:28:41,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2023-02-15 22:28:41,956 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 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-15 22:28:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:43,055 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2023-02-15 22:28:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 22:28:43,056 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 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 45 [2023-02-15 22:28:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:43,056 INFO L225 Difference]: With dead ends: 112 [2023-02-15 22:28:43,057 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 22:28:43,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2023-02-15 22:28:43,058 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 294 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:43,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1008 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1137 Invalid, 0 Unknown, 115 Unchecked, 0.6s Time] [2023-02-15 22:28:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 22:28:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2023-02-15 22:28:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:28:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2023-02-15 22:28:43,061 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 45 [2023-02-15 22:28:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:43,061 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2023-02-15 22:28:43,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 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-15 22:28:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2023-02-15 22:28:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:28:43,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:43,062 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-15 22:28:43,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:43,267 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-15 22:28:43,267 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253766, now seen corresponding path program 1 times [2023-02-15 22:28:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:43,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737007706] [2023-02-15 22:28:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:43,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:43,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:28:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:43,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:28:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:43,662 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-15 22:28:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:43,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737007706] [2023-02-15 22:28:43,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737007706] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:43,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471658959] [2023-02-15 22:28:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:43,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:43,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:43,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:43,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:28:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:43,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 22:28:43,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:43,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 22:28:43,995 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (exists ((v_ArrVal_784 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_784))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:28:44,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:44,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:28:44,020 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 22:28:44,020 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 18 [2023-02-15 22:28:44,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:28:44,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-15 22:28:44,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:28:44,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471658959] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:44,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:28:44,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-15 22:28:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883506982] [2023-02-15 22:28:44,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:44,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:28:44,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:44,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:28:44,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-15 22:28:44,080 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 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-15 22:28:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:44,339 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-02-15 22:28:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:28:44,339 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 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 45 [2023-02-15 22:28:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:44,340 INFO L225 Difference]: With dead ends: 104 [2023-02-15 22:28:44,340 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 22:28:44,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2023-02-15 22:28:44,341 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:44,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 518 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 3 Unknown, 88 Unchecked, 0.2s Time] [2023-02-15 22:28:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 22:28:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2023-02-15 22:28:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.375) 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-15 22:28:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-15 22:28:44,343 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2023-02-15 22:28:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:44,343 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-15 22:28:44,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 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-15 22:28:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-15 22:28:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:28:44,344 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:44,344 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-15 22:28:44,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 22:28:44,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:44,552 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash -35949242, now seen corresponding path program 1 times [2023-02-15 22:28:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:44,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589717768] [2023-02-15 22:28:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:44,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:28:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:28:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:44,809 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-15 22:28:44,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:44,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589717768] [2023-02-15 22:28:44,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589717768] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:44,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:44,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:28:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629989120] [2023-02-15 22:28:44,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:44,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:28:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:44,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:28:44,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:28:44,811 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 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-15 22:28:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:45,013 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2023-02-15 22:28:45,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:28:45,013 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 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 48 [2023-02-15 22:28:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:45,014 INFO L225 Difference]: With dead ends: 136 [2023-02-15 22:28:45,014 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 22:28:45,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:28:45,015 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 235 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:45,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 301 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 22:28:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2023-02-15 22:28:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.360655737704918) internal successors, (83), 74 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:28:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-02-15 22:28:45,018 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 48 [2023-02-15 22:28:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:45,018 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-02-15 22:28:45,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 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-15 22:28:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-02-15 22:28:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:28:45,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:45,019 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-15 22:28:45,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:28:45,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash -35949241, now seen corresponding path program 1 times [2023-02-15 22:28:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:45,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795749384] [2023-02-15 22:28:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:45,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:28:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:28:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 22:28:45,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:45,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795749384] [2023-02-15 22:28:45,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795749384] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:45,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:45,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:28:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738180829] [2023-02-15 22:28:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:45,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:28:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:28:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:28:45,339 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 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-15 22:28:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:45,574 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2023-02-15 22:28:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:28:45,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 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 48 [2023-02-15 22:28:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:45,575 INFO L225 Difference]: With dead ends: 126 [2023-02-15 22:28:45,576 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 22:28:45,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:28:45,576 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 150 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:45,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 323 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:28:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 22:28:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2023-02-15 22:28:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:28:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-02-15 22:28:45,580 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 48 [2023-02-15 22:28:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:45,581 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-02-15 22:28:45,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 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-15 22:28:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-02-15 22:28:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:28:45,599 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:45,599 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-15 22:28:45,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:28:45,600 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:45,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:45,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1114427801, now seen corresponding path program 1 times [2023-02-15 22:28:45,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:45,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470538562] [2023-02-15 22:28:45,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:45,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:28:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:28:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 22:28:45,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:45,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470538562] [2023-02-15 22:28:45,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470538562] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:45,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:45,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 22:28:45,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947931871] [2023-02-15 22:28:45,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:45,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:28:45,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:28:45,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:28:45,849 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 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-15 22:28:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:46,019 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2023-02-15 22:28:46,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:28:46,020 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 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 49 [2023-02-15 22:28:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:46,020 INFO L225 Difference]: With dead ends: 109 [2023-02-15 22:28:46,020 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 22:28:46,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:28:46,022 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 98 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:46,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 521 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:46,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 22:28:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2023-02-15 22:28:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:28:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-02-15 22:28:46,024 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 49 [2023-02-15 22:28:46,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:46,025 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-02-15 22:28:46,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 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-15 22:28:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-02-15 22:28:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:28:46,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:46,028 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-15 22:28:46,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 22:28:46,028 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:46,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828739, now seen corresponding path program 1 times [2023-02-15 22:28:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:46,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196152229] [2023-02-15 22:28:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:46,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:46,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:28:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:28:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:47,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:47,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196152229] [2023-02-15 22:28:47,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196152229] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:47,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449730939] [2023-02-15 22:28:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:47,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:47,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:47,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:47,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:28:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:47,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 115 conjunts are in the unsatisfiable core [2023-02-15 22:28:47,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:48,176 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:28:48,177 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 14 treesize of output 20 [2023-02-15 22:28:48,197 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:28:48,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:28:48,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:28:48,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:28:48,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:48,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2023-02-15 22:28:48,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:28:48,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:48,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:28:48,742 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1260 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1260))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1261 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1261))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1257 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1257))))) is different from true [2023-02-15 22:28:48,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:48,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2023-02-15 22:28:48,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:48,819 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:28:48,820 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 69 treesize of output 59 [2023-02-15 22:28:48,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:48,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:48,830 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:28:48,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:28:48,844 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:28:48,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:28:49,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:49,068 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:49,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:49,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 39 [2023-02-15 22:28:49,080 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-15 22:28:49,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2023-02-15 22:28:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 22:28:49,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:49,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449730939] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:49,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:49,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2023-02-15 22:28:49,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885663682] [2023-02-15 22:28:49,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:49,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 22:28:49,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:49,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 22:28:49,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2885, Unknown=5, NotChecked=108, Total=3192 [2023-02-15 22:28:49,513 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 51 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 44 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:53,097 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2023-02-15 22:28:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 22:28:53,098 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 44 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2023-02-15 22:28:53,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:53,099 INFO L225 Difference]: With dead ends: 171 [2023-02-15 22:28:53,099 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 22:28:53,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=668, Invalid=5493, Unknown=5, NotChecked=154, Total=6320 [2023-02-15 22:28:53,102 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1078 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:53,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1305 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1992 Invalid, 0 Unknown, 125 Unchecked, 1.4s Time] [2023-02-15 22:28:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 22:28:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 85. [2023-02-15 22:28:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.328358208955224) internal successors, (89), 80 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:28:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2023-02-15 22:28:53,106 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 49 [2023-02-15 22:28:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:53,106 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2023-02-15 22:28:53,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 44 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2023-02-15 22:28:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:28:53,108 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:53,108 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-15 22:28:53,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:53,314 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,SelfDestructingSolverStorable13 [2023-02-15 22:28:53,314 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828740, now seen corresponding path program 1 times [2023-02-15 22:28:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:53,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966966756] [2023-02-15 22:28:53,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:53,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:28:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:54,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:28:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:54,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:54,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966966756] [2023-02-15 22:28:54,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966966756] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:54,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33377736] [2023-02-15 22:28:54,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:54,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:54,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:54,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:28:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:54,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 93 conjunts are in the unsatisfiable core [2023-02-15 22:28:54,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:54,700 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 22:28:54,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-02-15 22:28:54,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:28:54,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:54,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:54,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 18 [2023-02-15 22:28:55,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:28:55,122 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (exists ((v_ArrVal_1433 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1433))) (exists ((v_ArrVal_1434 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1434))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:28:55,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:55,171 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 62 treesize of output 58 [2023-02-15 22:28:55,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:55,185 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:28:55,185 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 57 treesize of output 55 [2023-02-15 22:28:55,206 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2023-02-15 22:28:55,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 40 treesize of output 69 [2023-02-15 22:28:55,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2023-02-15 22:28:55,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:55,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:55,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 29 [2023-02-15 22:28:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 22:28:55,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:55,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33377736] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:55,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:55,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2023-02-15 22:28:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466438537] [2023-02-15 22:28:55,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:55,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 22:28:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:55,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 22:28:55,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2176, Unknown=3, NotChecked=94, Total=2450 [2023-02-15 22:28:55,789 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:57,991 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2023-02-15 22:28:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 22:28:57,991 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2023-02-15 22:28:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:57,992 INFO L225 Difference]: With dead ends: 127 [2023-02-15 22:28:57,992 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 22:28:57,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=528, Invalid=4163, Unknown=5, NotChecked=134, Total=4830 [2023-02-15 22:28:57,993 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 614 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:57,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1211 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1459 Invalid, 3 Unknown, 110 Unchecked, 0.7s Time] [2023-02-15 22:28:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 22:28:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 85. [2023-02-15 22:28:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:28:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2023-02-15 22:28:57,995 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 49 [2023-02-15 22:28:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:57,995 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2023-02-15 22:28:57,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2023-02-15 22:28:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:28:57,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:57,996 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] [2023-02-15 22:28:58,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:58,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 22:28:58,202 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:58,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash 218878957, now seen corresponding path program 1 times [2023-02-15 22:28:58,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:58,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977894377] [2023-02-15 22:28:58,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:58,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:58,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:28:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:28:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:58,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:28:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:58,497 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-15 22:28:58,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:58,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977894377] [2023-02-15 22:28:58,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977894377] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:58,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100205412] [2023-02-15 22:28:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:58,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:58,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:58,511 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:58,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:28:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:58,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-15 22:28:58,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:58,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:28:58,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:28:58,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:28:58,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:58,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 22:28:58,986 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 37 treesize of output 21 [2023-02-15 22:28:59,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:28:59,068 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:59,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:59,070 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 15 treesize of output 10 [2023-02-15 22:28:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 22:28:59,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:28:59,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100205412] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:59,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:28:59,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 28 [2023-02-15 22:28:59,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373475060] [2023-02-15 22:28:59,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:59,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:28:59,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:59,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:28:59,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2023-02-15 22:28:59,093 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (2), 1 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-15 22:28:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:59,564 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2023-02-15 22:28:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:28:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (2), 1 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 52 [2023-02-15 22:28:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:59,565 INFO L225 Difference]: With dead ends: 111 [2023-02-15 22:28:59,565 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 22:28:59,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1190, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 22:28:59,566 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 145 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:59,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 493 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:28:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 22:28:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2023-02-15 22:28:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:28:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-02-15 22:28:59,569 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 52 [2023-02-15 22:28:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:59,570 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-02-15 22:28:59,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (2), 1 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-15 22:28:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-02-15 22:28:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:28:59,570 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:59,570 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] [2023-02-15 22:28:59,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:59,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:59,775 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:28:59,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:59,775 INFO L85 PathProgramCache]: Analyzing trace with hash -521057353, now seen corresponding path program 1 times [2023-02-15 22:28:59,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:59,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885257299] [2023-02-15 22:28:59,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:00,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:00,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:00,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:29:00,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:00,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885257299] [2023-02-15 22:29:00,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885257299] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:00,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208876736] [2023-02-15 22:29:00,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:00,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:00,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:00,181 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:00,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:29:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:00,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 22:29:00,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:00,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 22:29:00,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:00,709 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1784 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1784))) (exists ((v_ArrVal_1782 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1782))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:29:00,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:00,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 22:29:00,745 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 22:29:00,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-15 22:29:00,869 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:29:00,869 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 29 treesize of output 30 [2023-02-15 22:29:00,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 22:29:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-15 22:29:00,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:00,997 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) v_ArrVal_1785) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 22:29:01,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208876736] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:01,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:01,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2023-02-15 22:29:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688202475] [2023-02-15 22:29:01,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:01,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 22:29:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:01,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 22:29:01,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1257, Unknown=18, NotChecked=146, Total=1560 [2023-02-15 22:29:01,076 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 36 states, 33 states have (on average 2.303030303030303) internal successors, (76), 32 states have internal predecessors, (76), 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-15 22:29:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:01,904 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2023-02-15 22:29:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 22:29:01,905 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.303030303030303) internal successors, (76), 32 states have internal predecessors, (76), 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 52 [2023-02-15 22:29:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:01,906 INFO L225 Difference]: With dead ends: 161 [2023-02-15 22:29:01,906 INFO L226 Difference]: Without dead ends: 161 [2023-02-15 22:29:01,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=436, Invalid=2633, Unknown=19, NotChecked=218, Total=3306 [2023-02-15 22:29:01,907 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1010 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:01,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 494 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 695 Invalid, 3 Unknown, 97 Unchecked, 0.3s Time] [2023-02-15 22:29:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-15 22:29:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 92. [2023-02-15 22:29:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 87 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2023-02-15 22:29:01,909 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 52 [2023-02-15 22:29:01,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:01,909 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2023-02-15 22:29:01,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.303030303030303) internal successors, (76), 32 states have internal predecessors, (76), 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-15 22:29:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2023-02-15 22:29:01,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:29:01,910 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:01,910 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] [2023-02-15 22:29:01,927 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-15 22:29:02,110 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,SelfDestructingSolverStorable16 [2023-02-15 22:29:02,110 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:29:02,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:02,111 INFO L85 PathProgramCache]: Analyzing trace with hash -521057352, now seen corresponding path program 1 times [2023-02-15 22:29:02,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:02,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580297815] [2023-02-15 22:29:02,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:02,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:02,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:02,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:02,833 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-15 22:29:02,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:02,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580297815] [2023-02-15 22:29:02,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580297815] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:02,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098901657] [2023-02-15 22:29:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:02,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:02,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:02,834 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:02,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:29:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:02,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 90 conjunts are in the unsatisfiable core [2023-02-15 22:29:02,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:02,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:29:03,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:03,044 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1960 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1960))) is different from true [2023-02-15 22:29:03,050 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1960 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1960))) is different from true [2023-02-15 22:29:03,062 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:29:03,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:29:03,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:03,226 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:29:03,227 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 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:29:03,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:29:03,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:03,488 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1964)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1963)))) is different from true [2023-02-15 22:29:03,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:03,509 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 23 treesize of output 23 [2023-02-15 22:29:03,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:03,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:29:03,749 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:29:03,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 61 [2023-02-15 22:29:03,754 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 36 treesize of output 27 [2023-02-15 22:29:03,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:03,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:29:03,803 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 33 treesize of output 17 [2023-02-15 22:29:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2023-02-15 22:29:03,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:03,957 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_1967 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_1967)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1967 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_1967)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1966) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 22:29:04,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:04,042 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 57 treesize of output 61 [2023-02-15 22:29:05,621 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1974))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((v_ArrVal_1966 (Array Int Int))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1966) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int)) (or (not (= 0 (select (select .cse1 .cse0) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4)))) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))))))))) (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int) (v_ArrVal_1967 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1974))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4))) (or (not (= 0 (select (select .cse2 .cse3) .cse4))) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select .cse5 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (< (select (select (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_ArrVal_1967)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 1)))))) (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)))) (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_prenex_6 Int) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1974))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse8 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4)) (.cse9 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975))) (or (not (= 0 (select (select .cse6 .cse7) .cse8))) (<= 0 (+ (select (select (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 v_prenex_6)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select .cse9 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))))))))) is different from false [2023-02-15 22:29:05,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098901657] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:05,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:05,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26] total 43 [2023-02-15 22:29:05,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949823921] [2023-02-15 22:29:05,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:05,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 22:29:05,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:05,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 22:29:05,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2102, Unknown=5, NotChecked=480, Total=2756 [2023-02-15 22:29:05,626 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 44 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:29:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:07,369 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2023-02-15 22:29:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 22:29:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2023-02-15 22:29:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:07,370 INFO L225 Difference]: With dead ends: 146 [2023-02-15 22:29:07,370 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 22:29:07,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=577, Invalid=3994, Unknown=5, NotChecked=680, Total=5256 [2023-02-15 22:29:07,372 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 869 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:07,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 729 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1060 Invalid, 0 Unknown, 327 Unchecked, 0.5s Time] [2023-02-15 22:29:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 22:29:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2023-02-15 22:29:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2023-02-15 22:29:07,374 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 52 [2023-02-15 22:29:07,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:07,374 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2023-02-15 22:29:07,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:29:07,375 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2023-02-15 22:29:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:29:07,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:07,375 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, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:07,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:29:07,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 22:29:07,581 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:29:07,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1804686442, now seen corresponding path program 1 times [2023-02-15 22:29:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:07,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906956838] [2023-02-15 22:29:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:07,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:29:07,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:07,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906956838] [2023-02-15 22:29:07,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906956838] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:07,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666158383] [2023-02-15 22:29:07,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:07,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:07,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:07,913 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:07,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 22:29:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:08,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 22:29:08,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:08,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:29:08,328 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2143 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2143)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:29:08,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:08,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 22:29:08,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 22:29:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2023-02-15 22:29:08,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:08,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666158383] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:08,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:08,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 22:29:08,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758306655] [2023-02-15 22:29:08,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:08,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:29:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:08,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:29:08,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=616, Unknown=3, NotChecked=50, Total=756 [2023-02-15 22:29:08,471 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 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-15 22:29:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:08,825 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-02-15 22:29:08,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:29:08,826 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 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 53 [2023-02-15 22:29:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:08,826 INFO L225 Difference]: With dead ends: 85 [2023-02-15 22:29:08,826 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 22:29:08,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1015, Unknown=3, NotChecked=66, Total=1260 [2023-02-15 22:29:08,827 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 339 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:08,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 374 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 300 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2023-02-15 22:29:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 22:29:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-15 22:29:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 80 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:29:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2023-02-15 22:29:08,829 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 53 [2023-02-15 22:29:08,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:08,829 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2023-02-15 22:29:08,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 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-15 22:29:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2023-02-15 22:29:08,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:29:08,830 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:08,830 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:08,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:29:09,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:09,035 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:29:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1947817869, now seen corresponding path program 2 times [2023-02-15 22:29:09,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:09,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256499708] [2023-02-15 22:29:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:09,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:10,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:10,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:10,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:29:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:10,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256499708] [2023-02-15 22:29:10,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256499708] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:10,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285754736] [2023-02-15 22:29:10,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:29:10,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:10,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:10,743 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:10,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 22:29:10,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:29:10,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:29:10,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 134 conjunts are in the unsatisfiable core [2023-02-15 22:29:10,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:11,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:11,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:11,375 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:29:11,375 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 16 treesize of output 22 [2023-02-15 22:29:11,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:11,394 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:29:11,394 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 16 treesize of output 22 [2023-02-15 22:29:11,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:11,412 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 22:29:11,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-02-15 22:29:11,532 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 23 treesize of output 22 [2023-02-15 22:29:11,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2023-02-15 22:29:11,853 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 22:29:11,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 60 [2023-02-15 22:29:11,860 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:29:11,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 18 [2023-02-15 22:29:11,949 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2317 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2318)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2317)))) is different from true [2023-02-15 22:29:11,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:11,986 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 22:29:11,986 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 101 [2023-02-15 22:29:11,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:11,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:11,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:11,995 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-02-15 22:29:11,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 76 [2023-02-15 22:29:12,006 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:29:12,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:29:12,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:12,549 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:29:12,560 INFO L321 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2023-02-15 22:29:12,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 96 [2023-02-15 22:29:12,573 INFO L321 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2023-02-15 22:29:12,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 37 [2023-02-15 22:29:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 22:29:12,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:13,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285754736] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:13,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:13,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 52 [2023-02-15 22:29:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752583542] [2023-02-15 22:29:13,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:13,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 22:29:13,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:13,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 22:29:13,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3019, Unknown=3, NotChecked=110, Total=3306 [2023-02-15 22:29:13,026 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 52 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:29:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:15,708 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2023-02-15 22:29:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:29:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-02-15 22:29:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:15,709 INFO L225 Difference]: With dead ends: 110 [2023-02-15 22:29:15,709 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 22:29:15,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=417, Invalid=5284, Unknown=3, NotChecked=148, Total=5852 [2023-02-15 22:29:15,711 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 116 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:15,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1314 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1373 Invalid, 0 Unknown, 102 Unchecked, 0.9s Time] [2023-02-15 22:29:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 22:29:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2023-02-15 22:29:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 98 states have internal predecessors, (107), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:29:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2023-02-15 22:29:15,716 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 53 [2023-02-15 22:29:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:15,716 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2023-02-15 22:29:15,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:29:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2023-02-15 22:29:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:29:15,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:15,717 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] [2023-02-15 22:29:15,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:29:15,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:15,923 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:29:15,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:15,923 INFO L85 PathProgramCache]: Analyzing trace with hash 729745886, now seen corresponding path program 1 times [2023-02-15 22:29:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:15,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104365356] [2023-02-15 22:29:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:16,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:29:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:16,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104365356] [2023-02-15 22:29:16,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104365356] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:16,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112717842] [2023-02-15 22:29:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:16,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:16,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:16,950 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:16,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 22:29:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:17,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-15 22:29:17,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:17,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:17,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:17,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2023-02-15 22:29:17,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:17,848 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2498 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2498))) (exists ((v_ArrVal_2497 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2497))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:29:17,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:17,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:29:17,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:17,882 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:29:17,882 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 36 treesize of output 40 [2023-02-15 22:29:17,890 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:29:17,890 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:29:18,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:29:18,059 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:29:18,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 21 [2023-02-15 22:29:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 22:29:18,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:18,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112717842] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:18,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:18,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2023-02-15 22:29:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713525179] [2023-02-15 22:29:18,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:18,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 22:29:18,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:18,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 22:29:18,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2606, Unknown=2, NotChecked=102, Total=2862 [2023-02-15 22:29:18,728 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 45 states, 43 states have (on average 2.255813953488372) internal successors, (97), 40 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:20,692 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2023-02-15 22:29:20,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:29:20,693 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.255813953488372) internal successors, (97), 40 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2023-02-15 22:29:20,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:20,693 INFO L225 Difference]: With dead ends: 97 [2023-02-15 22:29:20,693 INFO L226 Difference]: Without dead ends: 97 [2023-02-15 22:29:20,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=433, Invalid=4825, Unknown=2, NotChecked=142, Total=5402 [2023-02-15 22:29:20,694 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 306 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:20,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1098 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1278 Invalid, 0 Unknown, 74 Unchecked, 0.6s Time] [2023-02-15 22:29:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-15 22:29:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-02-15 22:29:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 90 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:29:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2023-02-15 22:29:20,697 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 56 [2023-02-15 22:29:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:20,697 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2023-02-15 22:29:20,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.255813953488372) internal successors, (97), 40 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2023-02-15 22:29:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:29:20,697 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:20,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:20,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:29:20,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 22:29:20,903 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:29:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 294390785, now seen corresponding path program 1 times [2023-02-15 22:29:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:20,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086601714] [2023-02-15 22:29:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:21,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:21,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:29:21,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:21,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086601714] [2023-02-15 22:29:21,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086601714] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:21,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398338217] [2023-02-15 22:29:21,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:21,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:21,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:21,611 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:21,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 22:29:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:21,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 90 conjunts are in the unsatisfiable core [2023-02-15 22:29:21,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:22,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:22,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:22,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:22,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2023-02-15 22:29:22,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:29:22,428 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2681 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2681))) (exists ((v_ArrVal_2680 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2680))) (exists ((v_ArrVal_2677 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2677))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:29:22,463 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 22:29:22,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-15 22:29:22,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:22,474 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:29:22,475 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 43 treesize of output 47 [2023-02-15 22:29:22,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:22,479 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 40 treesize of output 38 [2023-02-15 22:29:22,560 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 41 treesize of output 25 [2023-02-15 22:29:22,795 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 22:29:22,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 48 [2023-02-15 22:29:22,800 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 13 [2023-02-15 22:29:22,870 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 22:29:22,871 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 49 treesize of output 30 [2023-02-15 22:29:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 22:29:22,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:22,894 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2682 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2682) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 22:29:23,023 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2682 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| 4)) v_ArrVal_2682) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 22:29:23,027 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2682 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)) v_ArrVal_2682) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 22:29:23,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398338217] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:23,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:23,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2023-02-15 22:29:23,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455014493] [2023-02-15 22:29:23,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:23,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 22:29:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 22:29:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2330, Unknown=46, NotChecked=404, Total=2970 [2023-02-15 22:29:23,134 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 44 states have internal predecessors, (90), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:25,830 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2023-02-15 22:29:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 22:29:25,830 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 44 states have internal predecessors, (90), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2023-02-15 22:29:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:25,838 INFO L225 Difference]: With dead ends: 178 [2023-02-15 22:29:25,838 INFO L226 Difference]: Without dead ends: 178 [2023-02-15 22:29:25,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=841, Invalid=5605, Unknown=50, NotChecked=644, Total=7140 [2023-02-15 22:29:25,841 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1704 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 47 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:25,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 729 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1294 Invalid, 3 Unknown, 135 Unchecked, 0.7s Time] [2023-02-15 22:29:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-15 22:29:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 99. [2023-02-15 22:29:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 92 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:29:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2023-02-15 22:29:25,856 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 56 [2023-02-15 22:29:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:25,857 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2023-02-15 22:29:25,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 44 states have internal predecessors, (90), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2023-02-15 22:29:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:29:25,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:25,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:25,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:29:26,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 22:29:26,075 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:29:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash 294390786, now seen corresponding path program 1 times [2023-02-15 22:29:26,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:26,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984402412] [2023-02-15 22:29:26,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:26,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:26,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:29:26,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:26,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984402412] [2023-02-15 22:29:26,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984402412] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:26,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443945501] [2023-02-15 22:29:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:26,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:26,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:26,867 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:26,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 22:29:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:27,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 103 conjunts are in the unsatisfiable core [2023-02-15 22:29:27,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:27,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:27,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:27,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2023-02-15 22:29:27,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:27,597 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2865 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2865))) (exists ((v_ArrVal_2864 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2864))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:29:27,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:27,633 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:29:27,633 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 37 treesize of output 41 [2023-02-15 22:29:27,643 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:29:27,644 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:29:27,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:27,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:29:28,130 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-02-15 22:29:28,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 106 [2023-02-15 22:29:28,141 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 22:29:28,141 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 97 treesize of output 75 [2023-02-15 22:29:28,156 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:29:28,160 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:29:28,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 24 [2023-02-15 22:29:28,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:28,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 33 [2023-02-15 22:29:28,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 22:29:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 22:29:28,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:28,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:28,996 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 121 treesize of output 125 [2023-02-15 22:29:29,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443945501] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:29,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:29,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 56 [2023-02-15 22:29:29,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279833741] [2023-02-15 22:29:29,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:29,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-02-15 22:29:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:29,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-02-15 22:29:29,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=4283, Unknown=25, NotChecked=132, Total=4692 [2023-02-15 22:29:29,749 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 57 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 51 states have internal predecessors, (98), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:32,530 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2023-02-15 22:29:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 22:29:32,530 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 51 states have internal predecessors, (98), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2023-02-15 22:29:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:32,531 INFO L225 Difference]: With dead ends: 140 [2023-02-15 22:29:32,531 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 22:29:32,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2462 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=967, Invalid=9107, Unknown=30, NotChecked=198, Total=10302 [2023-02-15 22:29:32,535 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1302 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 40 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:32,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 892 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1517 Invalid, 3 Unknown, 82 Unchecked, 0.6s Time] [2023-02-15 22:29:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 22:29:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 101. [2023-02-15 22:29:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 94 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:29:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2023-02-15 22:29:32,546 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 56 [2023-02-15 22:29:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:32,546 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2023-02-15 22:29:32,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 51 states have internal predecessors, (98), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2023-02-15 22:29:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 22:29:32,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:32,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:32,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:29:32,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:32,754 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:29:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash 348951848, now seen corresponding path program 1 times [2023-02-15 22:29:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:32,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54910468] [2023-02-15 22:29:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:32,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:34,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:29:34,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:34,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54910468] [2023-02-15 22:29:34,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54910468] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:34,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822869919] [2023-02-15 22:29:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:34,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:34,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:34,743 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:34,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 22:29:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:34,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 150 conjunts are in the unsatisfiable core [2023-02-15 22:29:34,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:34,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:29:35,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:35,082 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:29:35,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:29:35,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:29:35,399 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:29:35,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:29:35,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:35,494 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 21 treesize of output 20 [2023-02-15 22:29:35,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:35,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:35,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2023-02-15 22:29:35,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:35,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:35,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:35,939 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-15 22:29:35,947 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3053 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_3055 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3053)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3055)) (= |c_#memory_int| (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_arrayElimArr_1)) (= (select v_arrayElimArr_1 0) |c_node_create_#in~data#1|) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:29:36,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:36,021 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:29:36,021 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 72 treesize of output 64 [2023-02-15 22:29:36,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:36,028 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 18 treesize of output 20 [2023-02-15 22:29:36,036 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:29:36,036 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:29:36,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:36,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:29:36,950 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:29:36,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:36,971 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2023-02-15 22:29:36,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 190 treesize of output 83 [2023-02-15 22:29:36,979 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 37 treesize of output 28 [2023-02-15 22:29:36,994 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:29:36,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2023-02-15 22:29:37,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:37,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:37,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 54 [2023-02-15 22:29:37,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:29:37,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:29:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 22:29:37,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:37,438 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3060 Int) (v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3058 Int)) (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3057) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_3060)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_3058)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:29:38,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:38,080 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 175 [2023-02-15 22:29:38,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822869919] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:38,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:38,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 65 [2023-02-15 22:29:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039114378] [2023-02-15 22:29:38,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:38,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-15 22:29:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:38,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-15 22:29:38,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=5008, Unknown=4, NotChecked=286, Total=5550 [2023-02-15 22:29:38,326 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 65 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 57 states have internal predecessors, (106), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:29:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:42,680 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2023-02-15 22:29:42,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-15 22:29:42,680 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 57 states have internal predecessors, (106), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 60 [2023-02-15 22:29:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:42,685 INFO L225 Difference]: With dead ends: 159 [2023-02-15 22:29:42,685 INFO L226 Difference]: Without dead ends: 159 [2023-02-15 22:29:42,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2566 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=878, Invalid=10466, Unknown=6, NotChecked=422, Total=11772 [2023-02-15 22:29:42,686 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 820 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:42,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1132 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2097 Invalid, 3 Unknown, 97 Unchecked, 1.1s Time] [2023-02-15 22:29:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-15 22:29:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2023-02-15 22:29:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 102 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:29:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2023-02-15 22:29:42,692 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 60 [2023-02-15 22:29:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:42,692 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2023-02-15 22:29:42,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 57 states have internal predecessors, (106), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:29:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2023-02-15 22:29:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 22:29:42,693 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:42,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2023-02-15 22:29:42,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 22:29:42,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:42,899 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:29:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:42,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394117, now seen corresponding path program 1 times [2023-02-15 22:29:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:42,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100113883] [2023-02-15 22:29:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:43,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:43,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:29:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:29:44,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:44,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100113883] [2023-02-15 22:29:44,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100113883] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:44,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359550051] [2023-02-15 22:29:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:44,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:44,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:44,193 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:44,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 22:29:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:44,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 135 conjunts are in the unsatisfiable core [2023-02-15 22:29:44,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:44,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:29:44,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:44,499 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3242 Int)) (= |c_#length| (store |c_old(#length)| |c_node_create_~temp~0#1.base| v_ArrVal_3242))) is different from true [2023-02-15 22:29:44,505 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3242 Int)) (= |c_#length| (store |c_old(#length)| |c_node_create_#res#1.base| v_ArrVal_3242))) is different from true [2023-02-15 22:29:44,516 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:29:44,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:29:44,705 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 9 treesize of output 7 [2023-02-15 22:29:44,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:29:44,888 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:29:44,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:29:44,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:44,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:29:45,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:45,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:45,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 34 [2023-02-15 22:29:45,385 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 9 treesize of output 7 [2023-02-15 22:29:45,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:29:45,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:45,590 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (exists ((v_ArrVal_3252 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3252))) (exists ((v_ArrVal_3248 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3248))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3251 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3251))))) is different from true [2023-02-15 22:29:45,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:45,622 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 26 [2023-02-15 22:29:45,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:45,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:29:45,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:45,642 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:29:45,642 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 79 treesize of output 67 [2023-02-15 22:29:45,665 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-15 22:29:45,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2023-02-15 22:29:46,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:46,322 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 25 treesize of output 29 [2023-02-15 22:29:46,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:46,543 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:29:46,576 INFO L321 Elim1Store]: treesize reduction 124, result has 23.9 percent of original size [2023-02-15 22:29:46,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 181 treesize of output 101 [2023-02-15 22:29:46,596 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 22:29:46,596 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 74 treesize of output 54 [2023-02-15 22:29:46,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:29:46,890 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:29:46,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:46,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:46,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 41 [2023-02-15 22:29:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2023-02-15 22:29:47,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:50,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359550051] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:50,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:50,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 70 [2023-02-15 22:29:50,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818339065] [2023-02-15 22:29:50,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:50,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-02-15 22:29:50,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:50,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-02-15 22:29:50,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=6198, Unknown=5, NotChecked=480, Total=6972 [2023-02-15 22:29:50,861 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 71 states, 68 states have (on average 1.6029411764705883) internal successors, (109), 62 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:29:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:58,062 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2023-02-15 22:29:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 22:29:58,063 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 68 states have (on average 1.6029411764705883) internal successors, (109), 62 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2023-02-15 22:29:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:58,063 INFO L225 Difference]: With dead ends: 184 [2023-02-15 22:29:58,063 INFO L226 Difference]: Without dead ends: 184 [2023-02-15 22:29:58,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1177, Invalid=11938, Unknown=7, NotChecked=684, Total=13806 [2023-02-15 22:29:58,065 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1734 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 52 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:58,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 1078 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2633 Invalid, 3 Unknown, 258 Unchecked, 1.7s Time] [2023-02-15 22:29:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-15 22:29:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 111. [2023-02-15 22:29:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 104 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:29:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2023-02-15 22:29:58,067 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 61 [2023-02-15 22:29:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:58,067 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2023-02-15 22:29:58,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 68 states have (on average 1.6029411764705883) internal successors, (109), 62 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:29:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2023-02-15 22:29:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 22:29:58,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:58,068 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2023-02-15 22:29:58,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-02-15 22:29:58,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 22:29:58,274 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:29:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394116, now seen corresponding path program 1 times [2023-02-15 22:29:58,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:58,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084534012] [2023-02-15 22:29:58,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:58,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:29:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:29:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:00,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:30:00,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084534012] [2023-02-15 22:30:00,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084534012] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934935635] [2023-02-15 22:30:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:00,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:00,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:00,436 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:00,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 22:30:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:00,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 139 conjunts are in the unsatisfiable core [2023-02-15 22:30:00,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:00,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:30:00,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:00,840 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:30:00,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:30:01,171 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:30:01,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:30:01,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:30:01,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:30:01,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:01,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2023-02-15 22:30:01,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:01,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:30:01,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:01,865 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3443 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3443))) (exists ((v_ArrVal_3442 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3442))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:30:01,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:01,905 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:30:01,906 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 72 treesize of output 64 [2023-02-15 22:30:01,917 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:30:01,917 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:30:01,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:01,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:01,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:30:02,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:02,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:30:02,622 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2023-02-15 22:30:02,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 200 treesize of output 93 [2023-02-15 22:30:02,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:02,630 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:30:02,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 61 [2023-02-15 22:30:02,912 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:30:02,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:02,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:02,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 60 [2023-02-15 22:30:02,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:02,934 INFO L321 Elim1Store]: treesize reduction 20, result has 25.9 percent of original size [2023-02-15 22:30:02,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 31 [2023-02-15 22:30:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 22:30:03,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:04,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:04,117 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 192 treesize of output 196 [2023-02-15 22:30:18,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934935635] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:18,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:18,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 71 [2023-02-15 22:30:18,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562775743] [2023-02-15 22:30:18,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:18,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-02-15 22:30:18,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:18,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-02-15 22:30:18,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=7057, Unknown=4, NotChecked=168, Total=7482 [2023-02-15 22:30:18,730 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 72 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 64 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:30:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:26,271 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2023-02-15 22:30:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-15 22:30:26,271 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 64 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2023-02-15 22:30:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:26,272 INFO L225 Difference]: With dead ends: 197 [2023-02-15 22:30:26,272 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 22:30:26,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2718 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=1042, Invalid=14458, Unknown=4, NotChecked=246, Total=15750 [2023-02-15 22:30:26,273 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1777 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 3219 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:26,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 1144 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3219 Invalid, 0 Unknown, 92 Unchecked, 1.8s Time] [2023-02-15 22:30:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 22:30:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 110. [2023-02-15 22:30:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 103 states have internal predecessors, (111), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:30:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2023-02-15 22:30:26,275 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 61 [2023-02-15 22:30:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:26,275 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2023-02-15 22:30:26,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 64 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:30:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2023-02-15 22:30:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:30:26,276 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:26,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:26,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:26,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 22:30:26,477 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:30:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash 335290514, now seen corresponding path program 1 times [2023-02-15 22:30:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:26,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305862364] [2023-02-15 22:30:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:27,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:27,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:28,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:30:28,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:28,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305862364] [2023-02-15 22:30:28,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305862364] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:28,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311576845] [2023-02-15 22:30:28,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:28,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:28,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:28,386 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:28,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 22:30:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:28,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 82 conjunts are in the unsatisfiable core [2023-02-15 22:30:28,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:29,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:30:29,387 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:30:29,387 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 37 treesize of output 20 [2023-02-15 22:30:29,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:29,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:30:29,535 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3626 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3626))) (exists ((v_ArrVal_3627 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3627))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:30:29,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:29,560 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:30:29,561 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 45 treesize of output 47 [2023-02-15 22:30:29,569 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:30:29,569 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:30:29,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:29,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:30:29,861 INFO L321 Elim1Store]: treesize reduction 70, result has 33.3 percent of original size [2023-02-15 22:30:29,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 63 [2023-02-15 22:30:29,879 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 22:30:29,879 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 21 treesize of output 20 [2023-02-15 22:30:29,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:30:30,026 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:30:30,031 INFO L321 Elim1Store]: treesize reduction 27, result has 10.0 percent of original size [2023-02-15 22:30:30,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 23 [2023-02-15 22:30:30,100 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-15 22:30:30,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:30,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311576845] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:30,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:30,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 29] total 63 [2023-02-15 22:30:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094238699] [2023-02-15 22:30:30,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:30,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-02-15 22:30:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-02-15 22:30:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4336, Unknown=2, NotChecked=132, Total=4692 [2023-02-15 22:30:30,729 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 63 states, 61 states have (on average 1.7540983606557377) internal successors, (107), 56 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:30:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:35,368 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2023-02-15 22:30:35,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 22:30:35,368 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 61 states have (on average 1.7540983606557377) internal successors, (107), 56 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2023-02-15 22:30:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:35,369 INFO L225 Difference]: With dead ends: 179 [2023-02-15 22:30:35,369 INFO L226 Difference]: Without dead ends: 179 [2023-02-15 22:30:35,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2131 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1048, Invalid=10944, Unknown=2, NotChecked=216, Total=12210 [2023-02-15 22:30:35,370 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 895 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:35,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 1178 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2325 Invalid, 0 Unknown, 136 Unchecked, 1.0s Time] [2023-02-15 22:30:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-15 22:30:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 115. [2023-02-15 22:30:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 108 states have internal predecessors, (116), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:30:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2023-02-15 22:30:35,373 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 62 [2023-02-15 22:30:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:35,373 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2023-02-15 22:30:35,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 61 states have (on average 1.7540983606557377) internal successors, (107), 56 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:30:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2023-02-15 22:30:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 22:30:35,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:35,377 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-15 22:30:35,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:35,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 22:30:35,584 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:30:35,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:35,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1413927454, now seen corresponding path program 1 times [2023-02-15 22:30:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:35,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459351302] [2023-02-15 22:30:35,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:35,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:37,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:37,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:30:38,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:38,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459351302] [2023-02-15 22:30:38,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459351302] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:38,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576059890] [2023-02-15 22:30:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:38,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:38,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:38,372 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:38,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 22:30:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:38,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 170 conjunts are in the unsatisfiable core [2023-02-15 22:30:38,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:38,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:30:39,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:39,001 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-15 22:30:39,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:39,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:30:39,525 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:30:39,525 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 22:30:39,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:39,546 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:30:39,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:30:39,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:30:39,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:30:39,738 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 20 treesize of output 22 [2023-02-15 22:30:40,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:40,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 39 [2023-02-15 22:30:40,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:40,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:30:40,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:30:40,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:30:40,402 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3822 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_3822))) (exists ((v_ArrVal_3823 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3823))) (exists ((v_ArrVal_3821 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3821))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:30:40,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:40,434 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:30:40,434 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 92 treesize of output 74 [2023-02-15 22:30:40,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:40,440 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 22 treesize of output 24 [2023-02-15 22:30:40,453 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:30:40,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:30:40,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:40,478 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:30:40,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:30:41,373 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 22:30:41,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 215 treesize of output 168 [2023-02-15 22:30:41,400 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2023-02-15 22:30:41,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 116 [2023-02-15 22:30:41,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:41,405 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 53 treesize of output 44 [2023-02-15 22:30:41,408 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 15 treesize of output 3 [2023-02-15 22:30:41,711 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:30:41,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:41,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:41,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 46 [2023-02-15 22:30:41,722 INFO L321 Elim1Store]: treesize reduction 20, result has 13.0 percent of original size [2023-02-15 22:30:41,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 16 [2023-02-15 22:30:41,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:30:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 22:30:42,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:42,479 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3827 (Array Int Int)) (v_ArrVal_3825 Int) (v_ArrVal_3826 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 v_ArrVal_3826)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3827))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse5 4))) (let ((.cse0 (select (select .cse6 .cse3) .cse4))) (or (not (<= 0 .cse0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 v_ArrVal_3825)) (select (select .cse2 .cse3) .cse4)) .cse0) |c_ULTIMATE.start_main_~data~0#1|) (not (<= 0 .cse5))))))))) is different from false [2023-02-15 22:30:44,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576059890] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:44,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:44,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 77 [2023-02-15 22:30:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884641014] [2023-02-15 22:30:44,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:44,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-02-15 22:30:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:44,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-02-15 22:30:44,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=7718, Unknown=4, NotChecked=354, Total=8372 [2023-02-15 22:30:44,107 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:30:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:56,423 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2023-02-15 22:30:56,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 22:30:56,424 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2023-02-15 22:30:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:56,424 INFO L225 Difference]: With dead ends: 166 [2023-02-15 22:30:56,425 INFO L226 Difference]: Without dead ends: 166 [2023-02-15 22:30:56,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2390 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1231, Invalid=14023, Unknown=6, NotChecked=490, Total=15750 [2023-02-15 22:30:56,426 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1255 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 3279 mSolverCounterSat, 60 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 3279 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:56,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 1645 Invalid, 3472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 3279 Invalid, 2 Unknown, 131 Unchecked, 2.2s Time] [2023-02-15 22:30:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-15 22:30:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2023-02-15 22:30:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.21875) internal successors, (117), 109 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:30:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2023-02-15 22:30:56,433 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 65 [2023-02-15 22:30:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:56,433 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2023-02-15 22:30:56,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:30:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2023-02-15 22:30:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:30:56,434 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:56,434 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:56,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-02-15 22:30:56,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:56,645 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:30:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:56,646 INFO L85 PathProgramCache]: Analyzing trace with hash -655878667, now seen corresponding path program 3 times [2023-02-15 22:30:56,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:56,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585347006] [2023-02-15 22:30:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:56,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:56,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:56,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 22:30:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:56,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-15 22:30:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-02-15 22:30:56,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:56,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585347006] [2023-02-15 22:30:56,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585347006] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:56,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059713501] [2023-02-15 22:30:56,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 22:30:56,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:56,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:56,742 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:56,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 22:30:57,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 22:30:57,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:30:57,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:30:57,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-02-15 22:30:57,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:30:57,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059713501] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:30:57,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:30:57,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-15 22:30:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736798948] [2023-02-15 22:30:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:30:57,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:30:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:57,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:30:57,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:30:57,115 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:30:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:57,126 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-15 22:30:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:30:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 66 [2023-02-15 22:30:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:57,127 INFO L225 Difference]: With dead ends: 77 [2023-02-15 22:30:57,127 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 22:30:57,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:30:57,127 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:57,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 81 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:30:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 22:30:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-15 22:30:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 72 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-15 22:30:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-15 22:30:57,129 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 66 [2023-02-15 22:30:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:57,129 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-15 22:30:57,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:30:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-15 22:30:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:30:57,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:57,130 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2023-02-15 22:30:57,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-02-15 22:30:57,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 22:30:57,337 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:30:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash -882077631, now seen corresponding path program 2 times [2023-02-15 22:30:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:57,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109616132] [2023-02-15 22:30:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:58,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:30:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:58,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:30:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:30:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:30:59,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:59,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109616132] [2023-02-15 22:30:59,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109616132] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:59,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969983500] [2023-02-15 22:30:59,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:30:59,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:59,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:59,516 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:59,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-15 22:30:59,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:30:59,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:30:59,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-15 22:30:59,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:59,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:30:59,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:30:59,945 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:30:59,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:31:00,275 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:31:00,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:31:00,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:31:00,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:31:00,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:00,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 28 [2023-02-15 22:31:00,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:00,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:31:01,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:01,086 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:31:01,087 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 63 treesize of output 57 [2023-02-15 22:31:01,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:01,104 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-02-15 22:31:01,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 38 [2023-02-15 22:31:01,130 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 22:31:01,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-15 22:31:02,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:02,081 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:02,106 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2023-02-15 22:31:02,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 196 treesize of output 96 [2023-02-15 22:31:02,124 INFO L321 Elim1Store]: treesize reduction 136, result has 9.9 percent of original size [2023-02-15 22:31:02,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 164 treesize of output 113 [2023-02-15 22:31:02,471 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2023-02-15 22:31:02,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 16 [2023-02-15 22:31:02,881 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:02,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:02,889 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 22:31:02,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 44 [2023-02-15 22:31:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:31:03,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:05,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969983500] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:05,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:31:05,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2023-02-15 22:31:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159050241] [2023-02-15 22:31:05,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:05,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-02-15 22:31:05,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:05,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-02-15 22:31:05,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=9185, Unknown=1, NotChecked=0, Total=9506 [2023-02-15 22:31:05,221 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 80 states, 77 states have (on average 1.5454545454545454) internal successors, (119), 71 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:31:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:14,820 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-15 22:31:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 22:31:14,820 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 77 states have (on average 1.5454545454545454) internal successors, (119), 71 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2023-02-15 22:31:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:14,821 INFO L225 Difference]: With dead ends: 112 [2023-02-15 22:31:14,821 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 22:31:14,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1410, Invalid=15879, Unknown=3, NotChecked=0, Total=17292 [2023-02-15 22:31:14,822 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1556 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 2598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:14,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 971 Invalid, 2598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2552 Invalid, 2 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 22:31:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 22:31:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2023-02-15 22:31:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:31:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-02-15 22:31:14,824 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 66 [2023-02-15 22:31:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:14,824 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-02-15 22:31:14,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 77 states have (on average 1.5454545454545454) internal successors, (119), 71 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:31:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-02-15 22:31:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:31:14,825 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:14,825 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2023-02-15 22:31:14,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-15 22:31:15,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:15,025 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:31:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash -882077630, now seen corresponding path program 2 times [2023-02-15 22:31:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:15,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774609418] [2023-02-15 22:31:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:17,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:31:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:17,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:31:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:17,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:31:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:31:18,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:18,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774609418] [2023-02-15 22:31:18,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774609418] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:18,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464617476] [2023-02-15 22:31:18,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:31:18,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:18,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:18,197 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:18,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-15 22:31:18,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:31:18,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:31:18,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 177 conjunts are in the unsatisfiable core [2023-02-15 22:31:18,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:18,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:18,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:31:18,762 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:18,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:31:18,977 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 11 treesize of output 7 [2023-02-15 22:31:19,112 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 22:31:19,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:31:19,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:31:19,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:31:19,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:19,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 32 [2023-02-15 22:31:19,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-02-15 22:31:19,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:31:19,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:19,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:19,990 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:31:19,990 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 71 treesize of output 63 [2023-02-15 22:31:20,000 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:31:20,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:31:20,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:20,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:31:21,012 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:21,045 INFO L321 Elim1Store]: treesize reduction 135, result has 17.2 percent of original size [2023-02-15 22:31:21,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 195 treesize of output 105 [2023-02-15 22:31:21,073 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2023-02-15 22:31:21,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 194 treesize of output 132 [2023-02-15 22:31:22,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:22,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:22,329 INFO L321 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2023-02-15 22:31:22,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 207 treesize of output 104 [2023-02-15 22:31:22,343 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-02-15 22:31:22,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 32 [2023-02-15 22:31:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:31:22,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:26,159 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 2927 treesize of output 2474 [2023-02-15 22:31:29,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464617476] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:29,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:31:29,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38] total 80 [2023-02-15 22:31:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190938900] [2023-02-15 22:31:29,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:29,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-02-15 22:31:29,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:29,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-02-15 22:31:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=9632, Unknown=1, NotChecked=0, Total=9900 [2023-02-15 22:31:29,154 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 81 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 72 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:31:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:40,728 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2023-02-15 22:31:40,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-15 22:31:40,728 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 72 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2023-02-15 22:31:40,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:40,729 INFO L225 Difference]: With dead ends: 129 [2023-02-15 22:31:40,729 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 22:31:40,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2684 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=991, Invalid=17640, Unknown=1, NotChecked=0, Total=18632 [2023-02-15 22:31:40,731 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1192 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 3621 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 3658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:40,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 1382 Invalid, 3658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3621 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-15 22:31:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 22:31:40,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 81. [2023-02-15 22:31:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:31:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-15 22:31:40,742 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 66 [2023-02-15 22:31:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:40,742 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-15 22:31:40,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 72 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:31:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-15 22:31:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 22:31:40,744 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:40,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-15 22:31:40,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-02-15 22:31:40,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:40,952 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:31:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1574604084, now seen corresponding path program 2 times [2023-02-15 22:31:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:40,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324927755] [2023-02-15 22:31:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:31:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:42,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:31:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:43,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:31:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:31:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:43,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324927755] [2023-02-15 22:31:43,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324927755] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:43,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769448804] [2023-02-15 22:31:43,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:31:43,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:43,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:43,715 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:43,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-15 22:31:44,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:31:44,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:31:44,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 170 conjunts are in the unsatisfiable core [2023-02-15 22:31:44,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:44,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:44,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:44,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:31:44,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:31:44,258 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:31:44,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:31:44,268 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:44,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:31:44,504 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 11 treesize of output 7 [2023-02-15 22:31:44,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:31:44,700 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:31:44,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:31:44,710 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 22:31:44,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:31:44,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:31:45,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:45,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2023-02-15 22:31:45,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-02-15 22:31:45,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:31:45,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:31:45,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:45,509 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 14 treesize of output 9 [2023-02-15 22:31:45,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:45,529 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 22:31:45,529 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 49 [2023-02-15 22:31:45,543 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:31:45,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:31:45,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:45,552 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 11 [2023-02-15 22:31:46,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:46,524 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 13 treesize of output 9 [2023-02-15 22:31:46,777 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:46,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:46,796 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2023-02-15 22:31:46,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 219 treesize of output 113 [2023-02-15 22:31:46,810 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-02-15 22:31:46,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 281 treesize of output 176 [2023-02-15 22:31:47,520 INFO L321 Elim1Store]: treesize reduction 96, result has 71.2 percent of original size [2023-02-15 22:31:47,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 386 treesize of output 502 [2023-02-15 22:32:03,177 INFO L321 Elim1Store]: treesize reduction 74, result has 71.0 percent of original size [2023-02-15 22:32:03,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 268 treesize of output 278 [2023-02-15 22:32:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:32:06,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:32:08,263 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4621 (Array Int Int)) (v_ArrVal_4622 (Array Int Int)) (v_ArrVal_4620 Int) (|v_ULTIMATE.start_sll_append_#t~ret7#1.base_50| Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_50| v_ArrVal_4621)) (.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_50| v_ArrVal_4622))) (let ((.cse12 (select (select .cse10 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse13 (+ (select (select .cse11 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse2 (select (select .cse11 .cse12) .cse13))) (let ((.cse3 (select (select .cse10 .cse12) .cse13)) (.cse1 (+ .cse2 4))) (let ((.cse9 (store .cse11 .cse3 (store (select .cse11 .cse3) .cse1 0)))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse10 .cse3))) (let ((.cse4 (let ((.cse6 (store .cse10 .cse3 (store .cse0 .cse1 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_50|)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ .cse5 4))) (select (select .cse6 (select (select .cse6 .cse7) .cse8)) (+ (select (select .cse9 .cse7) .cse8) 4)))))) (or (not (= (select .cse0 .cse1) 0)) (not (<= (+ .cse2 8) (select (store |c_#length| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_50| v_ArrVal_4620) .cse3))) (not (<= 0 .cse1)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_50|))) (< 0 .cse4) (not (<= 0 .cse5)) (= 0 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_50|) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_50| |c_#StackHeapBarrier|)) (<= (+ .cse4 1) 0)))))))))) is different from false [2023-02-15 22:32:08,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769448804] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:32:08,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:32:08,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 39] total 77 [2023-02-15 22:32:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655444294] [2023-02-15 22:32:08,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:32:08,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-02-15 22:32:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:32:08,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-02-15 22:32:08,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=8107, Unknown=1, NotChecked=180, Total=8556 [2023-02-15 22:32:08,267 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 77 states, 75 states have (on average 1.52) internal successors, (114), 68 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:32:20,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:32:20,525 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2023-02-15 22:32:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 22:32:20,525 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 75 states have (on average 1.52) internal successors, (114), 68 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 67 [2023-02-15 22:32:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:32:20,528 INFO L225 Difference]: With dead ends: 96 [2023-02-15 22:32:20,528 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 22:32:20,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 125 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=1154, Invalid=14599, Unknown=1, NotChecked=248, Total=16002 [2023-02-15 22:32:20,529 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1115 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:32:20,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1093 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-15 22:32:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 22:32:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2023-02-15 22:32:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:32:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2023-02-15 22:32:20,545 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 67 [2023-02-15 22:32:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:32:20,546 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2023-02-15 22:32:20,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 75 states have (on average 1.52) internal successors, (114), 68 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:32:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2023-02-15 22:32:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 22:32:20,549 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:32:20,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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-15 22:32:20,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-02-15 22:32:20,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:32:20,756 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 22:32:20,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:32:20,756 INFO L85 PathProgramCache]: Analyzing trace with hash 642840936, now seen corresponding path program 2 times [2023-02-15 22:32:20,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:32:20,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034661346] [2023-02-15 22:32:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:32:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:32:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:23,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 22:32:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:23,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:32:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:23,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 22:32:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:24,316 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:32:24,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:32:24,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034661346] [2023-02-15 22:32:24,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034661346] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:32:24,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296723488] [2023-02-15 22:32:24,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:32:24,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:32:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:32:24,319 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:32:24,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-02-15 22:32:24,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:32:24,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:32:24,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 217 conjunts are in the unsatisfiable core [2023-02-15 22:32:24,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:32:24,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:32:24,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:32:24,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:32:25,054 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:32:25,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:32:25,308 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 11 treesize of output 7 [2023-02-15 22:32:25,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:32:25,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:32:25,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:25,554 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 21 treesize of output 20 [2023-02-15 22:32:25,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:25,558 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 21 treesize of output 20 [2023-02-15 22:32:25,765 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:32:25,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:32:25,796 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 22:32:25,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 22:32:26,023 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:26,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 22:32:26,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:26,038 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 21 treesize of output 13 [2023-02-15 22:32:26,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:32:26,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 42 [2023-02-15 22:32:26,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 22:32:26,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:32:26,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:32:27,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:27,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:27,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:32:27,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:27,102 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:32:27,102 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 97 treesize of output 77 [2023-02-15 22:32:27,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:27,122 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:32:27,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 22:32:27,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 22:32:28,145 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:28,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2023-02-15 22:32:28,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:28,533 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:28,555 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2023-02-15 22:32:28,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 244 treesize of output 124 [2023-02-15 22:32:28,577 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2023-02-15 22:32:28,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 303 treesize of output 197 [2023-02-15 22:32:28,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2023-02-15 22:32:30,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:30,021 INFO L321 Elim1Store]: treesize reduction 27, result has 12.9 percent of original size [2023-02-15 22:32:30,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 366 treesize of output 123 [2023-02-15 22:32:30,029 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:32:30,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2023-02-15 22:32:30,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:32:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:32:30,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:32:33,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:32:33,238 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1299 treesize of output 1300 [2023-02-15 22:32:33,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:32:33,260 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 3221 treesize of output 3224 [2023-02-15 22:32:33,269 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 1290 treesize of output 659