./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:55:31,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:55:31,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:55:31,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:55:31,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:55:31,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:55:31,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:55:31,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:55:31,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:55:31,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:55:31,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:55:32,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:55:32,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:55:32,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:55:32,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:55:32,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:55:32,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:55:32,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:55:32,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:55:32,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:55:32,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:55:32,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:55:32,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:55:32,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:55:32,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:55:32,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:55:32,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:55:32,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:55:32,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:55:32,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:55:32,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:55:32,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:55:32,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:55:32,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:55:32,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:55:32,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:55:32,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:55:32,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:55:32,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:55:32,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:55:32,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:55:32,025 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:55:32,046 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:55:32,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:55:32,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:55:32,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:55:32,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:55:32,048 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:55:32,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:55:32,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:55:32,049 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:55:32,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:55:32,049 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:55:32,050 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:55:32,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:55:32,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:55:32,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:55:32,050 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:55:32,050 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:55:32,050 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:55:32,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:55:32,051 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:55:32,051 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:55:32,051 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:55:32,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:55:32,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:55:32,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:55:32,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:55:32,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:55:32,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:55:32,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:55:32,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:55:32,053 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:55:32,053 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:55:32,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:55:32,053 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:55:32,053 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2023-02-14 13:55:32,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:55:32,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:55:32,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:55:32,239 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:55:32,239 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:55:32,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-02-14 13:55:33,212 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:55:33,352 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:55:33,352 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-02-14 13:55:33,359 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7604c7e/92f923b60d3e425ea87375b69116fdb4/FLAG3734a0c97 [2023-02-14 13:55:33,369 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7604c7e/92f923b60d3e425ea87375b69116fdb4 [2023-02-14 13:55:33,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:55:33,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:55:33,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:55:33,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:55:33,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:55:33,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3620b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33, skipping insertion in model container [2023-02-14 13:55:33,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:55:33,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:55:33,633 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-02-14 13:55:33,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:55:33,642 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:55:33,671 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-02-14 13:55:33,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:55:33,696 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:55:33,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33 WrapperNode [2023-02-14 13:55:33,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:55:33,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:55:33,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:55:33,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:55:33,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,731 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2023-02-14 13:55:33,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:55:33,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:55:33,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:55:33,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:55:33,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,752 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:55:33,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:55:33,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:55:33,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:55:33,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (1/1) ... [2023-02-14 13:55:33,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:55:33,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:33,777 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-14 13:55:33,787 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-14 13:55:33,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:55:33,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:55:33,809 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-14 13:55:33,809 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-14 13:55:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:55:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:55:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 13:55:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:55:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:55:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:55:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 13:55:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:55:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:55:33,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:55:33,906 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:55:33,907 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:55:34,165 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:55:34,170 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:55:34,171 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 13:55:34,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:55:34 BoogieIcfgContainer [2023-02-14 13:55:34,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:55:34,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:55:34,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:55:34,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:55:34,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:55:33" (1/3) ... [2023-02-14 13:55:34,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17006af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:55:34, skipping insertion in model container [2023-02-14 13:55:34,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:55:33" (2/3) ... [2023-02-14 13:55:34,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17006af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:55:34, skipping insertion in model container [2023-02-14 13:55:34,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:55:34" (3/3) ... [2023-02-14 13:55:34,178 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-02-14 13:55:34,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:55:34,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-02-14 13:55:34,235 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:55:34,241 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;@2afccaa9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:55:34,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-02-14 13:55:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 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-14 13:55:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:55:34,250 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:34,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:55:34,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:34,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash 895367701, now seen corresponding path program 1 times [2023-02-14 13:55:34,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:34,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072757258] [2023-02-14 13:55:34,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:34,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:34,487 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-14 13:55:34,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:34,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072757258] [2023-02-14 13:55:34,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072757258] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:34,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:55:34,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:55:34,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424054952] [2023-02-14 13:55:34,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:34,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:55:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:55:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:55:34,531 INFO L87 Difference]: Start difference. First operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:55:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:34,640 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2023-02-14 13:55:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:55:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:55:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:34,651 INFO L225 Difference]: With dead ends: 119 [2023-02-14 13:55:34,651 INFO L226 Difference]: Without dead ends: 116 [2023-02-14 13:55:34,652 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-14 13:55:34,655 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:34,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:55:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-14 13:55:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-02-14 13:55:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.9193548387096775) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:55:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2023-02-14 13:55:34,683 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 6 [2023-02-14 13:55:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:34,683 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2023-02-14 13:55:34,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:55:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2023-02-14 13:55:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:55:34,684 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:34,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:55:34,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:55:34,684 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:34,685 INFO L85 PathProgramCache]: Analyzing trace with hash 895367702, now seen corresponding path program 1 times [2023-02-14 13:55:34,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:34,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535787888] [2023-02-14 13:55:34,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:34,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:34,801 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-14 13:55:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:34,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535787888] [2023-02-14 13:55:34,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535787888] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:34,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:55:34,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:55:34,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930291866] [2023-02-14 13:55:34,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:34,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:55:34,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:34,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:55:34,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:55:34,807 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:55:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:34,877 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2023-02-14 13:55:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:55:34,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:55:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:34,882 INFO L225 Difference]: With dead ends: 114 [2023-02-14 13:55:34,883 INFO L226 Difference]: Without dead ends: 114 [2023-02-14 13:55:34,886 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-14 13:55:34,888 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:34,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 191 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:55:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-14 13:55:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-02-14 13:55:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 62 states have (on average 1.8870967741935485) internal successors, (117), 109 states have internal predecessors, (117), 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-14 13:55:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2023-02-14 13:55:34,895 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 6 [2023-02-14 13:55:34,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:34,895 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2023-02-14 13:55:34,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:55:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2023-02-14 13:55:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 13:55:34,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:34,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:34,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:55:34,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1575141079, now seen corresponding path program 1 times [2023-02-14 13:55:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:34,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048874691] [2023-02-14 13:55:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:34,987 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-14 13:55:34,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:34,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048874691] [2023-02-14 13:55:34,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048874691] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:34,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:55:34,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:55:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360535381] [2023-02-14 13:55:34,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:34,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:55:34,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:34,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:55:34,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:55:34,990 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:55:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:35,068 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2023-02-14 13:55:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:55:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-14 13:55:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:35,069 INFO L225 Difference]: With dead ends: 121 [2023-02-14 13:55:35,069 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 13:55:35,070 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-14 13:55:35,070 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 5 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:35,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 284 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:55:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 13:55:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2023-02-14 13:55:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.873015873015873) internal successors, (118), 110 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:55:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2023-02-14 13:55:35,078 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 13 [2023-02-14 13:55:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:35,078 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2023-02-14 13:55:35,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:55:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2023-02-14 13:55:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 13:55:35,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:35,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:35,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:55:35,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086820, now seen corresponding path program 1 times [2023-02-14 13:55:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:35,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836045534] [2023-02-14 13:55:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:35,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:35,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:55:35,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:35,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836045534] [2023-02-14 13:55:35,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836045534] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:35,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:55:35,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:55:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663314529] [2023-02-14 13:55:35,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:35,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:55:35,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:55:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:55:35,194 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:55:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:35,363 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2023-02-14 13:55:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:55:35,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-14 13:55:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:35,366 INFO L225 Difference]: With dead ends: 115 [2023-02-14 13:55:35,366 INFO L226 Difference]: Without dead ends: 115 [2023-02-14 13:55:35,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:55:35,373 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 13 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:35,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 405 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:55:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-14 13:55:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2023-02-14 13:55:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 109 states have internal predecessors, (117), 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-14 13:55:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2023-02-14 13:55:35,387 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 22 [2023-02-14 13:55:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:35,388 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2023-02-14 13:55:35,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:55:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2023-02-14 13:55:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 13:55:35,389 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:35,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:35,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:55:35,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:35,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086819, now seen corresponding path program 1 times [2023-02-14 13:55:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:35,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075401210] [2023-02-14 13:55:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:55:35,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:35,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075401210] [2023-02-14 13:55:35,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075401210] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:35,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:55:35,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:55:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940036503] [2023-02-14 13:55:35,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:35,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:55:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:55:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:55:35,630 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:55:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:35,791 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2023-02-14 13:55:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:55:35,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-14 13:55:35,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:35,793 INFO L225 Difference]: With dead ends: 114 [2023-02-14 13:55:35,796 INFO L226 Difference]: Without dead ends: 114 [2023-02-14 13:55:35,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:55:35,798 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 11 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:35,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 429 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:55:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-14 13:55:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2023-02-14 13:55:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 108 states have internal predecessors, (116), 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-14 13:55:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2023-02-14 13:55:35,814 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 22 [2023-02-14 13:55:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:35,814 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2023-02-14 13:55:35,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:55:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2023-02-14 13:55:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 13:55:35,815 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:35,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:35,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 13:55:35,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:35,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578181, now seen corresponding path program 1 times [2023-02-14 13:55:35,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:35,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644389644] [2023-02-14 13:55:35,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:35,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:35,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:35,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:55:36,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:36,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644389644] [2023-02-14 13:55:36,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644389644] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:36,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434724854] [2023-02-14 13:55:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:36,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:36,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:36,005 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-14 13:55:36,006 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-14 13:55:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:36,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 13:55:36,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:36,129 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-14 13:55:36,178 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2023-02-14 13:55:36,188 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2023-02-14 13:55:36,204 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:55:36,205 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-14 13:55:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-14 13:55:36,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:55:36,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434724854] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:55:36,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:55:36,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-14 13:55:36,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45111438] [2023-02-14 13:55:36,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:36,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 13:55:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:36,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 13:55:36,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-14 13:55:36,503 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 13:55:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:36,725 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2023-02-14 13:55:36,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:55:36,725 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-14 13:55:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:36,726 INFO L225 Difference]: With dead ends: 130 [2023-02-14 13:55:36,726 INFO L226 Difference]: Without dead ends: 130 [2023-02-14 13:55:36,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-14 13:55:36,727 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:36,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 416 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 388 Invalid, 0 Unknown, 272 Unchecked, 0.2s Time] [2023-02-14 13:55:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-14 13:55:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2023-02-14 13:55:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 107 states have internal predecessors, (115), 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-14 13:55:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2023-02-14 13:55:36,734 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 25 [2023-02-14 13:55:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:36,735 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2023-02-14 13:55:36,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 13:55:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2023-02-14 13:55:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 13:55:36,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:36,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:36,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 13:55:36,941 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-14 13:55:36,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578182, now seen corresponding path program 1 times [2023-02-14 13:55:36,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:36,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463751253] [2023-02-14 13:55:36,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:36,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:37,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:37,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:55:37,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:37,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463751253] [2023-02-14 13:55:37,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463751253] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:37,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772251088] [2023-02-14 13:55:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:37,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:37,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:37,299 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-14 13:55:37,301 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-14 13:55:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:37,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 13:55:37,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:37,395 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-14 13:55:37,518 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_362 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_362))))) is different from true [2023-02-14 13:55:37,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:37,555 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 16 [2023-02-14 13:55:37,561 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:55:37,562 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-14 13:55:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 13:55:37,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:37,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772251088] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:37,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:55:37,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2023-02-14 13:55:37,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612098690] [2023-02-14 13:55:37,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:37,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 13:55:37,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:37,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 13:55:37,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2023-02-14 13:55:37,670 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:55:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:38,097 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2023-02-14 13:55:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:55:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-02-14 13:55:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:38,098 INFO L225 Difference]: With dead ends: 112 [2023-02-14 13:55:38,098 INFO L226 Difference]: Without dead ends: 112 [2023-02-14 13:55:38,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2023-02-14 13:55:38,099 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 117 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:38,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 625 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 788 Invalid, 0 Unknown, 114 Unchecked, 0.4s Time] [2023-02-14 13:55:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-14 13:55:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2023-02-14 13:55:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 106 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:55:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2023-02-14 13:55:38,101 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 25 [2023-02-14 13:55:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:38,101 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2023-02-14 13:55:38,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:55:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2023-02-14 13:55:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 13:55:38,102 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:38,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:38,121 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-14 13:55:38,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-14 13:55:38,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:38,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:38,308 INFO L85 PathProgramCache]: Analyzing trace with hash 131514271, now seen corresponding path program 1 times [2023-02-14 13:55:38,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:38,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599975569] [2023-02-14 13:55:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:38,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:38,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:55:38,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:38,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599975569] [2023-02-14 13:55:38,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599975569] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:38,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633525946] [2023-02-14 13:55:38,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:38,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:38,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:38,626 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-14 13:55:38,660 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-14 13:55:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:38,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 13:55:38,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:38,757 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-14 13:55:38,765 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-14 13:55:38,778 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:55:38,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:38,803 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-14 13:55:38,814 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-14 13:55:38,820 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_522))))) is different from true [2023-02-14 13:55:38,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:38,852 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-14 13:55:38,864 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-14 13:55:38,877 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:55:38,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:55:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2023-02-14 13:55:38,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:38,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633525946] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:38,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:55:38,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2023-02-14 13:55:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271763285] [2023-02-14 13:55:38,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:38,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 13:55:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 13:55:38,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=122, Unknown=3, NotChecked=72, Total=240 [2023-02-14 13:55:38,981 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-14 13:55:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:39,225 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2023-02-14 13:55:39,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:55:39,225 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2023-02-14 13:55:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:39,226 INFO L225 Difference]: With dead ends: 121 [2023-02-14 13:55:39,226 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 13:55:39,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=163, Unknown=3, NotChecked=84, Total=306 [2023-02-14 13:55:39,226 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 178 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:39,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 280 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 372 Unchecked, 0.2s Time] [2023-02-14 13:55:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 13:55:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2023-02-14 13:55:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 98 states have internal predecessors, (106), 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-14 13:55:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2023-02-14 13:55:39,229 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 37 [2023-02-14 13:55:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:39,229 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2023-02-14 13:55:39,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-14 13:55:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2023-02-14 13:55:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 13:55:39,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:39,229 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:39,239 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-14 13:55:39,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:39,430 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash 131514272, now seen corresponding path program 1 times [2023-02-14 13:55:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:39,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296010346] [2023-02-14 13:55:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:39,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:55:39,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:39,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296010346] [2023-02-14 13:55:39,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296010346] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:39,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436487347] [2023-02-14 13:55:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:39,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:39,812 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-14 13:55:39,813 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-14 13:55:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:39,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 13:55:39,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:39,931 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-14 13:55:39,948 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-14 13:55:39,960 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_683 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_683) |c_#length|)))) is different from true [2023-02-14 13:55:39,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:39,983 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-14 13:55:39,996 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-14 13:55:40,001 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_684 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_684) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:55:40,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:40,027 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-14 13:55:40,070 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-14 13:55:40,075 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_685 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_685))))) is different from true [2023-02-14 13:55:40,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:40,097 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-14 13:55:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-14 13:55:40,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:40,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436487347] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:40,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:55:40,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-14 13:55:40,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97046108] [2023-02-14 13:55:40,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:40,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 13:55:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:40,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 13:55:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2023-02-14 13:55:40,166 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:55:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:40,430 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2023-02-14 13:55:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:55:40,431 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2023-02-14 13:55:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:40,431 INFO L225 Difference]: With dead ends: 113 [2023-02-14 13:55:40,431 INFO L226 Difference]: Without dead ends: 113 [2023-02-14 13:55:40,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=336, Unknown=3, NotChecked=120, Total=552 [2023-02-14 13:55:40,432 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 360 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:40,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 231 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 309 Invalid, 0 Unknown, 291 Unchecked, 0.2s Time] [2023-02-14 13:55:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-14 13:55:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2023-02-14 13:55:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 90 states have internal predecessors, (98), 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-14 13:55:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2023-02-14 13:55:40,434 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 37 [2023-02-14 13:55:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:40,434 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2023-02-14 13:55:40,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:55:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2023-02-14 13:55:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 13:55:40,435 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:40,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:40,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 13:55:40,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:40,641 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:40,641 INFO L85 PathProgramCache]: Analyzing trace with hash 931477670, now seen corresponding path program 1 times [2023-02-14 13:55:40,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:40,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365908788] [2023-02-14 13:55:40,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:40,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:40,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:40,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:55:41,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:41,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365908788] [2023-02-14 13:55:41,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365908788] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:41,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965974709] [2023-02-14 13:55:41,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:41,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:41,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:41,096 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-14 13:55:41,123 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-14 13:55:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:41,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 13:55:41,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:41,257 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-14 13:55:41,387 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-14 13:55:41,459 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_846 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_846)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 13:55:41,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:41,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:55:41,493 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-14 13:55:41,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-02-14 13:55:41,517 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-14 13:55:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-14 13:55:41,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:41,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965974709] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:41,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:55:41,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2023-02-14 13:55:41,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554119036] [2023-02-14 13:55:41,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:41,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 13:55:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:41,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 13:55:41,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2023-02-14 13:55:41,592 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 26 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:55:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:42,135 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2023-02-14 13:55:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 13:55:42,135 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2023-02-14 13:55:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:42,136 INFO L225 Difference]: With dead ends: 186 [2023-02-14 13:55:42,136 INFO L226 Difference]: Without dead ends: 186 [2023-02-14 13:55:42,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1064, Unknown=1, NotChecked=68, Total=1332 [2023-02-14 13:55:42,137 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 779 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:42,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 501 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 735 Invalid, 0 Unknown, 177 Unchecked, 0.4s Time] [2023-02-14 13:55:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-14 13:55:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 97. [2023-02-14 13:55:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 92 states have internal predecessors, (102), 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-14 13:55:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2023-02-14 13:55:42,139 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 40 [2023-02-14 13:55:42,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:42,140 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2023-02-14 13:55:42,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:55:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2023-02-14 13:55:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 13:55:42,140 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:42,140 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:42,151 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-14 13:55:42,345 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,SelfDestructingSolverStorable9 [2023-02-14 13:55:42,345 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash 931477671, now seen corresponding path program 1 times [2023-02-14 13:55:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:42,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068432766] [2023-02-14 13:55:42,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:42,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:42,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:55:43,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:43,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068432766] [2023-02-14 13:55:43,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068432766] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:43,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002349490] [2023-02-14 13:55:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:43,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:43,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:43,015 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-14 13:55:43,017 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-14 13:55:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:43,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-14 13:55:43,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:43,146 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-14 13:55:43,181 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1009 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1009))) is different from true [2023-02-14 13:55:43,188 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1009 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1009))) is different from true [2023-02-14 13:55:43,199 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:55:43,200 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-14 13:55:43,326 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:55:43,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-14 13:55:43,732 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1015 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1015) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1014 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1014) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1011 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1011))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 13:55:43,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:43,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-14 13:55:43,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:43,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2023-02-14 13:55:43,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:43,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-14 13:55:43,772 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-02-14 13:55:43,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 13:55:43,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-14 13:55:43,813 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-14 13:55:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2023-02-14 13:55:43,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:44,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002349490] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:44,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:55:44,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 40 [2023-02-14 13:55:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849714144] [2023-02-14 13:55:44,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:44,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-14 13:55:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-14 13:55:44,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1598, Unknown=4, NotChecked=246, Total=1980 [2023-02-14 13:55:44,507 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:55:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:46,059 INFO L93 Difference]: Finished difference Result 204 states and 222 transitions. [2023-02-14 13:55:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 13:55:46,059 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2023-02-14 13:55:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:46,060 INFO L225 Difference]: With dead ends: 204 [2023-02-14 13:55:46,060 INFO L226 Difference]: Without dead ends: 204 [2023-02-14 13:55:46,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=349, Invalid=2739, Unknown=4, NotChecked=330, Total=3422 [2023-02-14 13:55:46,061 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1745 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:46,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 595 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1182 Invalid, 0 Unknown, 536 Unchecked, 0.7s Time] [2023-02-14 13:55:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-14 13:55:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 97. [2023-02-14 13:55:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 92 states have internal predecessors, (101), 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-14 13:55:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2023-02-14 13:55:46,064 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 40 [2023-02-14 13:55:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:46,064 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2023-02-14 13:55:46,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:55:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2023-02-14 13:55:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:55:46,065 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:46,065 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:46,070 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-14 13:55:46,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:46,270 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:46,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1188964921, now seen corresponding path program 1 times [2023-02-14 13:55:46,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:46,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332044239] [2023-02-14 13:55:46,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:46,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:55:46,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:46,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332044239] [2023-02-14 13:55:46,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332044239] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:46,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:55:46,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:55:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94043062] [2023-02-14 13:55:46,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:46,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:55:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:46,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:55:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:55:46,326 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:55:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:46,372 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2023-02-14 13:55:46,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:55:46,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2023-02-14 13:55:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:46,373 INFO L225 Difference]: With dead ends: 141 [2023-02-14 13:55:46,373 INFO L226 Difference]: Without dead ends: 141 [2023-02-14 13:55:46,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:55:46,374 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 64 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:46,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 223 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:55:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-14 13:55:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 98. [2023-02-14 13:55:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 93 states have internal predecessors, (102), 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-14 13:55:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2023-02-14 13:55:46,377 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 41 [2023-02-14 13:55:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:46,377 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2023-02-14 13:55:46,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:55:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2023-02-14 13:55:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 13:55:46,380 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:46,380 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:46,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 13:55:46,381 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:46,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:46,381 INFO L85 PathProgramCache]: Analyzing trace with hash -133740632, now seen corresponding path program 1 times [2023-02-14 13:55:46,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:46,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369791118] [2023-02-14 13:55:46,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:46,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-14 13:55:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:46,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369791118] [2023-02-14 13:55:46,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369791118] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:46,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:55:46,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:55:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383795667] [2023-02-14 13:55:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:46,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:55:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:55:46,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:55:46,464 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:55:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:46,570 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2023-02-14 13:55:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:55:46,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2023-02-14 13:55:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:46,571 INFO L225 Difference]: With dead ends: 113 [2023-02-14 13:55:46,571 INFO L226 Difference]: Without dead ends: 113 [2023-02-14 13:55:46,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:55:46,572 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 69 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:46,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 281 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:55:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-14 13:55:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2023-02-14 13:55:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.5) internal successors, (99), 90 states have internal predecessors, (99), 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-14 13:55:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2023-02-14 13:55:46,574 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 43 [2023-02-14 13:55:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:46,574 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2023-02-14 13:55:46,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:55:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2023-02-14 13:55:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 13:55:46,576 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:46,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:46,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 13:55:46,576 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:46,577 INFO L85 PathProgramCache]: Analyzing trace with hash -133740631, now seen corresponding path program 1 times [2023-02-14 13:55:46,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:46,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370940814] [2023-02-14 13:55:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-14 13:55:46,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:46,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370940814] [2023-02-14 13:55:46,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370940814] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:46,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396169066] [2023-02-14 13:55:46,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:46,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:46,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:46,703 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-14 13:55:46,706 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-14 13:55:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:46,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 13:55:46,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:55:46,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:55:46,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396169066] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:46,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:55:46,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-14 13:55:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983712867] [2023-02-14 13:55:46,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:46,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:55:46,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:46,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:55:46,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:55:46,866 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:55:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:46,877 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2023-02-14 13:55:46,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:55:46,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2023-02-14 13:55:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:46,878 INFO L225 Difference]: With dead ends: 94 [2023-02-14 13:55:46,879 INFO L226 Difference]: Without dead ends: 94 [2023-02-14 13:55:46,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:55:46,879 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 83 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:46,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 192 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:55:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-14 13:55:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-02-14 13:55:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.4923076923076923) 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-14 13:55:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2023-02-14 13:55:46,881 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 43 [2023-02-14 13:55:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:46,882 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2023-02-14 13:55:46,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:55:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2023-02-14 13:55:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 13:55:46,882 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:46,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:46,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-14 13:55:47,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:47,088 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash -132415732, now seen corresponding path program 1 times [2023-02-14 13:55:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:47,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134817952] [2023-02-14 13:55:47,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:47,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:47,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:47,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-14 13:55:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:47,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134817952] [2023-02-14 13:55:47,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134817952] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:47,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988739335] [2023-02-14 13:55:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:47,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:47,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:47,241 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-14 13:55:47,243 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-14 13:55:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:47,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 13:55:47,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:55:47,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:55:47,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988739335] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:47,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:55:47,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-14 13:55:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138689061] [2023-02-14 13:55:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:47,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:55:47,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:47,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:55:47,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:55:47,424 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:55:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:47,440 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-14 13:55:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:55:47,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2023-02-14 13:55:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:47,441 INFO L225 Difference]: With dead ends: 91 [2023-02-14 13:55:47,441 INFO L226 Difference]: Without dead ends: 91 [2023-02-14 13:55:47,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:55:47,442 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 145 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:47,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 148 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:55:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-14 13:55:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-14 13:55:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.453125) internal successors, (93), 86 states have internal predecessors, (93), 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-14 13:55:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2023-02-14 13:55:47,445 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 43 [2023-02-14 13:55:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:47,445 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2023-02-14 13:55:47,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:55:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2023-02-14 13:55:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 13:55:47,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:47,446 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:47,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 13:55:47,655 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,SelfDestructingSolverStorable14 [2023-02-14 13:55:47,656 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 190077985, now seen corresponding path program 1 times [2023-02-14 13:55:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:47,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179412431] [2023-02-14 13:55:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:47,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:47,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:55:47,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:47,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179412431] [2023-02-14 13:55:47,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179412431] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:47,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:55:47,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:55:47,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043904612] [2023-02-14 13:55:47,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:47,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:55:47,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:47,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:55:47,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:55:47,732 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:55:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:47,805 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2023-02-14 13:55:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:55:47,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-02-14 13:55:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:47,806 INFO L225 Difference]: With dead ends: 108 [2023-02-14 13:55:47,806 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 13:55:47,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:55:47,807 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 63 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:47,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 193 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:55:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 13:55:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-02-14 13:55:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.4375) internal successors, (92), 85 states have internal predecessors, (92), 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-14 13:55:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2023-02-14 13:55:47,811 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 44 [2023-02-14 13:55:47,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:47,811 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2023-02-14 13:55:47,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:55:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2023-02-14 13:55:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 13:55:47,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:47,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:47,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 13:55:47,812 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash 190077986, now seen corresponding path program 1 times [2023-02-14 13:55:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:47,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995046886] [2023-02-14 13:55:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:47,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:48,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:55:48,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:48,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995046886] [2023-02-14 13:55:48,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995046886] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:48,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336254671] [2023-02-14 13:55:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:48,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:48,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:48,569 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-14 13:55:48,571 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-14 13:55:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:48,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 13:55:48,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:55:48,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:55:48,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336254671] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:48,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:55:48,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [19] total 21 [2023-02-14 13:55:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337704084] [2023-02-14 13:55:48,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:48,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:55:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:55:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2023-02-14 13:55:48,778 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:55:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:48,837 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2023-02-14 13:55:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:55:48,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-02-14 13:55:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:48,838 INFO L225 Difference]: With dead ends: 89 [2023-02-14 13:55:48,838 INFO L226 Difference]: Without dead ends: 89 [2023-02-14 13:55:48,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2023-02-14 13:55:48,839 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 66 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:48,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:55:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-14 13:55:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-14 13:55:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.421875) internal successors, (91), 84 states have internal predecessors, (91), 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-14 13:55:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2023-02-14 13:55:48,843 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 44 [2023-02-14 13:55:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:48,843 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2023-02-14 13:55:48,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:55:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2023-02-14 13:55:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 13:55:48,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:48,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:48,852 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-14 13:55:49,049 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,SelfDestructingSolverStorable16 [2023-02-14 13:55:49,049 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1597450267, now seen corresponding path program 1 times [2023-02-14 13:55:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:49,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425694218] [2023-02-14 13:55:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:49,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:49,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:49,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 13:55:49,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:49,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425694218] [2023-02-14 13:55:49,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425694218] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:49,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:55:49,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:55:49,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470878337] [2023-02-14 13:55:49,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:49,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:55:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:49,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:55:49,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:55:49,203 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:55:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:49,305 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-02-14 13:55:49,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:55:49,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-14 13:55:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:49,306 INFO L225 Difference]: With dead ends: 86 [2023-02-14 13:55:49,306 INFO L226 Difference]: Without dead ends: 86 [2023-02-14 13:55:49,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:55:49,306 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:49,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 284 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:55:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-14 13:55:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-14 13:55:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.375) internal successors, (88), 81 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-14 13:55:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-02-14 13:55:49,308 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 45 [2023-02-14 13:55:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:49,308 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-02-14 13:55:49,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:55:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-02-14 13:55:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 13:55:49,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:49,308 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:49,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-14 13:55:49,309 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash 552513247, now seen corresponding path program 1 times [2023-02-14 13:55:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:49,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381642834] [2023-02-14 13:55:49,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:49,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:49,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:49,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:55:49,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:49,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381642834] [2023-02-14 13:55:49,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381642834] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:49,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319994369] [2023-02-14 13:55:49,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:49,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:49,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:49,868 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-14 13:55:49,875 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-14 13:55:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:50,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-14 13:55:50,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:50,158 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-14 13:55:50,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:50,332 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-14 13:55:50,343 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 13:55:50,344 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-14 13:55:50,474 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 13:55:50,475 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 29 treesize of output 32 [2023-02-14 13:55:50,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:50,565 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:55:50,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 55 [2023-02-14 13:55:50,585 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-14 13:55:50,664 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 69 treesize of output 45 [2023-02-14 13:55:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 13:55:50,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:55:50,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319994369] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:55:50,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:55:50,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [23] total 37 [2023-02-14 13:55:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577703228] [2023-02-14 13:55:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:55:50,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 13:55:50,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 13:55:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1296, Unknown=1, NotChecked=0, Total=1406 [2023-02-14 13:55:50,750 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 17 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:55:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:51,824 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2023-02-14 13:55:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 13:55:51,825 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2023-02-14 13:55:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:51,825 INFO L225 Difference]: With dead ends: 156 [2023-02-14 13:55:51,826 INFO L226 Difference]: Without dead ends: 156 [2023-02-14 13:55:51,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=2268, Unknown=1, NotChecked=0, Total=2550 [2023-02-14 13:55:51,827 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 417 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:51,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 635 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 804 Invalid, 2 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 13:55:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-14 13:55:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 86. [2023-02-14 13:55:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.3692307692307693) 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-14 13:55:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-02-14 13:55:51,829 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 49 [2023-02-14 13:55:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:51,829 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-02-14 13:55:51,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:55:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-02-14 13:55:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 13:55:51,830 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:51,830 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:51,839 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-14 13:55:52,032 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-14 13:55:52,033 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:55:52,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:52,033 INFO L85 PathProgramCache]: Analyzing trace with hash 552513248, now seen corresponding path program 1 times [2023-02-14 13:55:52,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:52,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361124258] [2023-02-14 13:55:52,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:52,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:55:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:52,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:55:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:53,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:55:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:55:53,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:53,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361124258] [2023-02-14 13:55:53,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361124258] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:53,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140741893] [2023-02-14 13:55:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:53,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:53,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:53,443 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-14 13:55:53,443 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-14 13:55:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:53,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-14 13:55:53,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:53,646 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-14 13:55:53,957 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-14 13:55:53,961 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-14 13:55:54,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:54,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:55:54,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:54,289 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-14 13:55:54,296 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:55:54,296 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-14 13:55:54,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:54,303 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-14 13:55:54,475 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 13:55:54,475 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 19 treesize of output 26 [2023-02-14 13:55:54,491 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 13:55:54,491 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 29 treesize of output 32 [2023-02-14 13:55:54,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:54,634 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:55:54,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 76 [2023-02-14 13:55:54,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:54,652 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:55:54,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2023-02-14 13:55:54,710 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 11 treesize of output 7 [2023-02-14 13:55:54,776 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-14 13:55:54,787 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-14 13:55:57,136 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 90 treesize of output 66 [2023-02-14 13:55:57,138 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 70 treesize of output 54 [2023-02-14 13:55:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:55:57,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:00,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140741893] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:00,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:00,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 21] total 51 [2023-02-14 13:56:00,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776559497] [2023-02-14 13:56:00,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:00,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-14 13:56:00,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:00,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-14 13:56:00,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3415, Unknown=11, NotChecked=0, Total=3660 [2023-02-14 13:56:00,507 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 52 states, 48 states have (on average 1.75) internal successors, (84), 45 states have internal predecessors, (84), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:56:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:05,332 INFO L93 Difference]: Finished difference Result 228 states and 252 transitions. [2023-02-14 13:56:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-14 13:56:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 1.75) internal successors, (84), 45 states have internal predecessors, (84), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2023-02-14 13:56:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:05,333 INFO L225 Difference]: With dead ends: 228 [2023-02-14 13:56:05,334 INFO L226 Difference]: Without dead ends: 228 [2023-02-14 13:56:05,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=738, Invalid=7804, Unknown=14, NotChecked=0, Total=8556 [2023-02-14 13:56:05,335 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 751 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 48 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:05,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1750 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2570 Invalid, 4 Unknown, 0 Unchecked, 2.1s Time] [2023-02-14 13:56:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-14 13:56:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 92. [2023-02-14 13:56:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.352112676056338) internal successors, (96), 87 states have internal predecessors, (96), 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-14 13:56:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2023-02-14 13:56:05,339 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 49 [2023-02-14 13:56:05,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:05,339 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2023-02-14 13:56:05,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 1.75) internal successors, (84), 45 states have internal predecessors, (84), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:56:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2023-02-14 13:56:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-14 13:56:05,339 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:05,340 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:05,348 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-14 13:56:05,545 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-14 13:56:05,545 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:56:05,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:05,546 INFO L85 PathProgramCache]: Analyzing trace with hash -220833143, now seen corresponding path program 1 times [2023-02-14 13:56:05,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:05,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338458661] [2023-02-14 13:56:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:05,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:05,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:56:05,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:05,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338458661] [2023-02-14 13:56:05,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338458661] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:05,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721826875] [2023-02-14 13:56:05,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:05,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:05,698 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-14 13:56:05,727 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-14 13:56:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:05,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-14 13:56:05,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:05,910 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-14 13:56:05,912 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-14 13:56:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:56:05,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:56:06,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721826875] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:56:06,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:56:06,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2023-02-14 13:56:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324314393] [2023-02-14 13:56:06,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:06,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:56:06,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:06,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:56:06,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:56:06,017 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:56:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:06,166 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-02-14 13:56:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:56:06,167 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2023-02-14 13:56:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:06,167 INFO L225 Difference]: With dead ends: 84 [2023-02-14 13:56:06,167 INFO L226 Difference]: Without dead ends: 84 [2023-02-14 13:56:06,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-14 13:56:06,168 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:06,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 531 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-14 13:56:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-14 13:56:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 79 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-14 13:56:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2023-02-14 13:56:06,170 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 50 [2023-02-14 13:56:06,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:06,170 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2023-02-14 13:56:06,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:56:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2023-02-14 13:56:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 13:56:06,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:06,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:06,176 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-14 13:56:06,376 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-14 13:56:06,376 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:56:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1610711870, now seen corresponding path program 1 times [2023-02-14 13:56:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:06,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273200788] [2023-02-14 13:56:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:08,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:08,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:08,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273200788] [2023-02-14 13:56:08,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273200788] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:08,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865772399] [2023-02-14 13:56:08,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:08,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:08,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:08,558 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-14 13:56:08,560 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-14 13:56:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:08,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-14 13:56:08,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:08,793 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-14 13:56:09,060 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-14 13:56:09,186 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:09,186 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-14 13:56:09,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 13:56:09,499 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-14 13:56:09,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-02-14 13:56:09,740 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-14 13:56:09,744 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-14 13:56:09,763 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-14 13:56:10,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:10,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-14 13:56:10,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:10,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-02-14 13:56:10,106 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:56:10,106 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-14 13:56:10,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-02-14 13:56:10,639 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:10,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2023-02-14 13:56:10,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2023-02-14 13:56:10,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:10,662 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-14 13:56:10,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:10,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-02-14 13:56:10,764 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-14 13:56:10,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:10,773 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-14 13:56:10,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-14 13:56:10,884 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-14 13:56:11,006 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-14 13:56:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:11,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:11,207 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2634 (Array Int Int)) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2633) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2632) |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_circular_insert_~new_node~0#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-14 13:56:12,587 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2629 Int) (v_ArrVal_2646 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2634 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2630 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_22| Int) (v_ArrVal_2628 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_22| v_ArrVal_2646))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_22| |c_#StackHeapBarrier|)) (not (<= 0 .cse0)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_22|) 0)) (= (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_22| v_ArrVal_2645))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_22| v_ArrVal_2644))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_ArrVal_2629))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_22| v_ArrVal_2633) (select (select (store (store .cse3 .cse2 v_ArrVal_2630) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_22| v_ArrVal_2632) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse4 .cse2 v_ArrVal_2628) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_22| v_ArrVal_2634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-02-14 13:56:12,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865772399] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:12,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:12,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 59 [2023-02-14 13:56:12,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952673802] [2023-02-14 13:56:12,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:12,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-14 13:56:12,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:12,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-14 13:56:12,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4182, Unknown=2, NotChecked=262, Total=4692 [2023-02-14 13:56:12,592 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:56:15,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:15,721 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2023-02-14 13:56:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 13:56:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2023-02-14 13:56:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:15,723 INFO L225 Difference]: With dead ends: 171 [2023-02-14 13:56:15,723 INFO L226 Difference]: Without dead ends: 171 [2023-02-14 13:56:15,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=622, Invalid=7574, Unknown=2, NotChecked=358, Total=8556 [2023-02-14 13:56:15,725 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 505 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:15,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1344 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-14 13:56:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-14 13:56:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 108. [2023-02-14 13:56:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 101 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-14 13:56:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2023-02-14 13:56:15,727 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 51 [2023-02-14 13:56:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:15,727 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2023-02-14 13:56:15,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:56:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2023-02-14 13:56:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 13:56:15,728 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:15,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:15,739 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-14 13:56:15,933 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-14 13:56:15,934 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:56:15,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash -761382722, now seen corresponding path program 1 times [2023-02-14 13:56:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:15,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32550133] [2023-02-14 13:56:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:16,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:16,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:16,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 13:56:16,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:16,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32550133] [2023-02-14 13:56:16,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32550133] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:16,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:16,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 13:56:16,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664056864] [2023-02-14 13:56:16,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:16,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:56:16,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:16,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:56:16,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:56:16,227 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:56:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:16,514 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2023-02-14 13:56:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 13:56:16,514 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-14 13:56:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:16,515 INFO L225 Difference]: With dead ends: 150 [2023-02-14 13:56:16,515 INFO L226 Difference]: Without dead ends: 150 [2023-02-14 13:56:16,515 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-14 13:56:16,516 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 153 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:16,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 592 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:56:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-14 13:56:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 104. [2023-02-14 13:56:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 97 states have internal predecessors, (106), 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-14 13:56:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2023-02-14 13:56:16,518 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 51 [2023-02-14 13:56:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:16,519 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2023-02-14 13:56:16,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:56:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2023-02-14 13:56:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 13:56:16,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:16,519 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:16,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-14 13:56:16,520 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:56:16,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1544354016, now seen corresponding path program 1 times [2023-02-14 13:56:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:16,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154731423] [2023-02-14 13:56:16,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:16,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:16,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:16,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:56:16,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:16,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154731423] [2023-02-14 13:56:16,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154731423] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:16,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296264570] [2023-02-14 13:56:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:16,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:16,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:16,697 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-14 13:56:16,720 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-14 13:56:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:16,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 13:56:16,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:16,925 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-14 13:56:16,941 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2936 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2936))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-02-14 13:56:16,965 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-14 13:56:16,980 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2937 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2937))))) is different from true [2023-02-14 13:56:17,005 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-14 13:56:17,026 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2938 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2938))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-02-14 13:56:17,049 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-14 13:56:17,055 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-14 13:56:17,076 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:17,076 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-14 13:56:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-14 13:56:17,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 13:56:17,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296264570] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:56:17,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:56:17,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2023-02-14 13:56:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430726604] [2023-02-14 13:56:17,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:17,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 13:56:17,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 13:56:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2023-02-14 13:56:17,437 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-14 13:56:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:17,585 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2023-02-14 13:56:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:56:17,589 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 53 [2023-02-14 13:56:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:17,589 INFO L225 Difference]: With dead ends: 100 [2023-02-14 13:56:17,589 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 13:56:17,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=247, Unknown=3, NotChecked=108, Total=462 [2023-02-14 13:56:17,590 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 210 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:17,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 193 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 164 Invalid, 0 Unknown, 216 Unchecked, 0.1s Time] [2023-02-14 13:56:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 13:56:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-14 13:56:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 93 states have internal predecessors, (100), 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-14 13:56:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2023-02-14 13:56:17,592 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 53 [2023-02-14 13:56:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:17,592 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2023-02-14 13:56:17,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-14 13:56:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2023-02-14 13:56:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-14 13:56:17,593 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:17,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:17,601 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-14 13:56:17,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:17,799 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 13:56:17,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1326985614, now seen corresponding path program 1 times [2023-02-14 13:56:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:17,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974621494] [2023-02-14 13:56:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:17,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:18,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:18,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:18,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:19,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:19,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974621494] [2023-02-14 13:56:19,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974621494] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:19,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180846590] [2023-02-14 13:56:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:19,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:19,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:19,077 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-14 13:56:19,079 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-14 13:56:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:19,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-14 13:56:19,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:19,676 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-14 13:56:19,679 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-14 13:56:19,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:56:19,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:19,936 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-14 13:56:19,946 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:56:19,946 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-14 13:56:20,331 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-14 13:56:20,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 37 [2023-02-14 13:56:20,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:20,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-14 13:56:20,418 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 13:56:20,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 83 [2023-02-14 13:56:20,433 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:20,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 72 [2023-02-14 13:56:20,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2023-02-14 13:56:20,708 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 13:56:20,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 26 [2023-02-14 13:56:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:20,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:20,737 INFO L321 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2023-02-14 13:56:20,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-02-14 13:56:20,741 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |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_circular_insert_~new_node~0#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-14 13:56:20,746 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3130) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-14 13:56:20,763 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3130) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-14 13:56:20,769 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3130) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-14 13:56:20,775 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3130) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-14 13:56:21,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:21,072 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 11796 treesize of output 11231 [2023-02-14 13:56:21,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:21,099 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 11220 treesize of output 10940 [2023-02-14 13:56:21,125 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 10932 treesize of output 10804 [2023-02-14 13:56:21,144 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 10804 treesize of output 10740