./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:46:05,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:46:05,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:46:05,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:46:05,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:46:05,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:46:05,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:46:05,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:46:05,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:46:05,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:46:05,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:46:05,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:46:05,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:46:05,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:46:05,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:46:05,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:46:05,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:46:05,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:46:05,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:46:05,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:46:05,233 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:46:05,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:46:05,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:46:05,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:46:05,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:46:05,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:46:05,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:46:05,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:46:05,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:46:05,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:46:05,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:46:05,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:46:05,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:46:05,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:46:05,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:46:05,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:46:05,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:46:05,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:46:05,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:46:05,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:46:05,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:46:05,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:46:05,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:46:05,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:46:05,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:46:05,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:46:05,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:46:05,296 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:46:05,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:46:05,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:46:05,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:46:05,297 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:46:05,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:46:05,298 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:46:05,298 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:46:05,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:46:05,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:46:05,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:46:05,299 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:46:05,306 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:46:05,307 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:46:05,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:46:05,307 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:46:05,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:46:05,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:46:05,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:46:05,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:46:05,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:46:05,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:46:05,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:46:05,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:46:05,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:46:05,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:46:05,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-07-21 17:46:05,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:46:05,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:46:05,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:46:05,629 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:46:05,631 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:46:05,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-07-21 17:46:05,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52a8ed31/cac972b528a54a4b8ea07bb6f9bb52d6/FLAGe070bf279 [2022-07-21 17:46:06,066 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:46:06,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-07-21 17:46:06,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52a8ed31/cac972b528a54a4b8ea07bb6f9bb52d6/FLAGe070bf279 [2022-07-21 17:46:06,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52a8ed31/cac972b528a54a4b8ea07bb6f9bb52d6 [2022-07-21 17:46:06,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:46:06,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:46:06,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:46:06,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:46:06,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:46:06,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee350b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06, skipping insertion in model container [2022-07-21 17:46:06,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:46:06,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:46:06,727 WARN L230 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_append_equal.i[24433,24446] [2022-07-21 17:46:06,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:46:06,749 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:46:06,811 WARN L230 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_append_equal.i[24433,24446] [2022-07-21 17:46:06,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:46:06,841 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:46:06,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06 WrapperNode [2022-07-21 17:46:06,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:46:06,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:46:06,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:46:06,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:46:06,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,910 INFO L137 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2022-07-21 17:46:06,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:46:06,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:46:06,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:46:06,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:46:06,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:46:06,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:46:06,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:46:06,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:46:06,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (1/1) ... [2022-07-21 17:46:06,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:46:06,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:06,976 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) [2022-07-21 17:46:06,985 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 [2022-07-21 17:46:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 17:46:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 17:46:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 17:46:07,010 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 17:46:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:46:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:46:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 17:46:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:46:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:46:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:46:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 17:46:07,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:46:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:46:07,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:46:07,130 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:46:07,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:46:07,465 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:46:07,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:46:07,471 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 17:46:07,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:46:07 BoogieIcfgContainer [2022-07-21 17:46:07,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:46:07,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:46:07,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:46:07,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:46:07,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:46:06" (1/3) ... [2022-07-21 17:46:07,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ba4e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:46:07, skipping insertion in model container [2022-07-21 17:46:07,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:46:06" (2/3) ... [2022-07-21 17:46:07,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ba4e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:46:07, skipping insertion in model container [2022-07-21 17:46:07,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:46:07" (3/3) ... [2022-07-21 17:46:07,482 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-07-21 17:46:07,497 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:46:07,497 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-07-21 17:46:07,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:46:07,580 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22a477b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6322daf [2022-07-21 17:46:07,581 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-07-21 17:46:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 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) [2022-07-21 17:46:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:46:07,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:07,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:46:07,604 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2022-07-21 17:46:07,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:07,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480503351] [2022-07-21 17:46:07,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:07,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:46:07,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:07,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480503351] [2022-07-21 17:46:07,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480503351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:07,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:07,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:46:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428086192] [2022-07-21 17:46:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:07,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:46:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:07,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:46:07,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:46:07,857 INFO L87 Difference]: Start difference. First operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 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) [2022-07-21 17:46:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:07,987 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-07-21 17:46:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:46:07,989 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 [2022-07-21 17:46:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:08,001 INFO L225 Difference]: With dead ends: 114 [2022-07-21 17:46:08,001 INFO L226 Difference]: Without dead ends: 111 [2022-07-21 17:46:08,003 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 [2022-07-21 17:46:08,006 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:08,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:46:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-21 17:46:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-21 17:46:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-07-21 17:46:08,052 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2022-07-21 17:46:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:08,052 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-07-21 17:46:08,053 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) [2022-07-21 17:46:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-07-21 17:46:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:46:08,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:08,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:46:08,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:46:08,055 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:08,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2022-07-21 17:46:08,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:08,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774487450] [2022-07-21 17:46:08,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:46:08,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:08,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774487450] [2022-07-21 17:46:08,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774487450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:08,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:08,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:46:08,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961203429] [2022-07-21 17:46:08,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:08,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:46:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:08,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:46:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:46:08,151 INFO L87 Difference]: Start difference. First operand 111 states and 119 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) [2022-07-21 17:46:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:08,232 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-07-21 17:46:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:46:08,233 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 [2022-07-21 17:46:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:08,234 INFO L225 Difference]: With dead ends: 109 [2022-07-21 17:46:08,235 INFO L226 Difference]: Without dead ends: 109 [2022-07-21 17:46:08,235 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 [2022-07-21 17:46:08,236 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:08,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:46:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-21 17:46:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-07-21 17:46:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.88135593220339) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-07-21 17:46:08,244 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2022-07-21 17:46:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:08,245 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-07-21 17:46:08,245 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) [2022-07-21 17:46:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-07-21 17:46:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:46:08,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:08,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:46:08,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:46:08,246 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2022-07-21 17:46:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:08,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134792116] [2022-07-21 17:46:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:46:08,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:08,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134792116] [2022-07-21 17:46:08,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134792116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:08,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:08,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:46:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213513387] [2022-07-21 17:46:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:08,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:46:08,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:46:08,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:46:08,320 INFO L87 Difference]: Start difference. First operand 109 states and 117 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) [2022-07-21 17:46:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:08,406 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-07-21 17:46:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:46:08,406 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 [2022-07-21 17:46:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:08,408 INFO L225 Difference]: With dead ends: 116 [2022-07-21 17:46:08,408 INFO L226 Difference]: Without dead ends: 116 [2022-07-21 17:46:08,408 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 [2022-07-21 17:46:08,409 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:08,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:46:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-21 17:46:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2022-07-21 17:46:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2022-07-21 17:46:08,422 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2022-07-21 17:46:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:08,423 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2022-07-21 17:46:08,423 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) [2022-07-21 17:46:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2022-07-21 17:46:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:46:08,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:08,424 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:46:08,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:46:08,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:08,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2022-07-21 17:46:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:08,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393600465] [2022-07-21 17:46:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:08,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:46:08,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:08,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393600465] [2022-07-21 17:46:08,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393600465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:08,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:08,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:46:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005032417] [2022-07-21 17:46:08,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:08,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:46:08,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:08,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:46:08,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:46:08,531 INFO L87 Difference]: Start difference. First operand 110 states and 118 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) [2022-07-21 17:46:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:08,758 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-07-21 17:46:08,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:46:08,758 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 [2022-07-21 17:46:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:08,760 INFO L225 Difference]: With dead ends: 110 [2022-07-21 17:46:08,761 INFO L226 Difference]: Without dead ends: 110 [2022-07-21 17:46:08,761 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 [2022-07-21 17:46:08,771 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:08,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 380 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:46:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-21 17:46:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-07-21 17:46:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-07-21 17:46:08,787 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2022-07-21 17:46:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:08,787 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-07-21 17:46:08,787 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) [2022-07-21 17:46:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-07-21 17:46:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:46:08,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:08,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:46:08,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:46:08,789 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:08,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2022-07-21 17:46:08,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:08,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869781274] [2022-07-21 17:46:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:08,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:08,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:46:08,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:08,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869781274] [2022-07-21 17:46:08,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869781274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:08,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:08,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:46:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448955661] [2022-07-21 17:46:08,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:08,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:46:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:08,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:46:08,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:46:08,923 INFO L87 Difference]: Start difference. First operand 109 states and 117 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) [2022-07-21 17:46:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:09,157 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-07-21 17:46:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:46:09,158 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 [2022-07-21 17:46:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:09,159 INFO L225 Difference]: With dead ends: 109 [2022-07-21 17:46:09,159 INFO L226 Difference]: Without dead ends: 109 [2022-07-21 17:46:09,159 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 [2022-07-21 17:46:09,160 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:09,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:46:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-21 17:46:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2022-07-21 17:46:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 103 states have internal predecessors, (110), 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) [2022-07-21 17:46:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-07-21 17:46:09,166 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2022-07-21 17:46:09,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:09,167 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-07-21 17:46:09,167 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) [2022-07-21 17:46:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-07-21 17:46:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:46:09,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:09,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:46:09,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:46:09,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2022-07-21 17:46:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:09,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004394983] [2022-07-21 17:46:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:09,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:09,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:46:09,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:09,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004394983] [2022-07-21 17:46:09,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004394983] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:09,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042685914] [2022-07-21 17:46:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:09,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:09,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:09,335 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) [2022-07-21 17:46:09,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 17:46:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:09,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 17:46:09,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:09,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:09,662 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:46:09,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:46:09,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:46:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:46:10,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042685914] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:46:10,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:46:10,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-07-21 17:46:10,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143207434] [2022-07-21 17:46:10,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:46:10,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 17:46:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 17:46:10,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-21 17:46:10,058 INFO L87 Difference]: Start difference. First operand 108 states and 116 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) [2022-07-21 17:46:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:10,300 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2022-07-21 17:46:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:46:10,301 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 [2022-07-21 17:46:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:10,302 INFO L225 Difference]: With dead ends: 114 [2022-07-21 17:46:10,302 INFO L226 Difference]: Without dead ends: 114 [2022-07-21 17:46:10,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:46:10,303 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 31 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:10,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 657 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 179 Unchecked, 0.2s Time] [2022-07-21 17:46:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-21 17:46:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-21 17:46:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2022-07-21 17:46:10,308 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 25 [2022-07-21 17:46:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:10,313 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2022-07-21 17:46:10,313 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) [2022-07-21 17:46:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2022-07-21 17:46:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:46:10,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:10,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:46:10,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:46:10,527 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 [2022-07-21 17:46:10,528 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2022-07-21 17:46:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:10,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553157648] [2022-07-21 17:46:10,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:10,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:46:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553157648] [2022-07-21 17:46:10,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553157648] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:10,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135711880] [2022-07-21 17:46:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:10,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:10,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:10,785 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) [2022-07-21 17:46:10,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 17:46:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:10,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-21 17:46:10,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:10,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:11,128 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:46:11,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:11,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-07-21 17:46:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:46:11,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:46:11,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135711880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:11,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:46:11,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-07-21 17:46:11,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738019949] [2022-07-21 17:46:11,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:46:11,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 17:46:11,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:11,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 17:46:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:46:11,334 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:46:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:11,829 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-07-21 17:46:11,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:46:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-07-21 17:46:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:11,830 INFO L225 Difference]: With dead ends: 115 [2022-07-21 17:46:11,830 INFO L226 Difference]: Without dead ends: 115 [2022-07-21 17:46:11,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-07-21 17:46:11,831 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 209 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:11,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 590 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:46:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-21 17:46:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-07-21 17:46:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2022-07-21 17:46:11,837 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 25 [2022-07-21 17:46:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:11,838 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2022-07-21 17:46:11,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:46:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-07-21 17:46:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:46:11,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:11,839 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] [2022-07-21 17:46:11,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:46:12,051 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 [2022-07-21 17:46:12,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2022-07-21 17:46:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:12,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34320495] [2022-07-21 17:46:12,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:12,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:12,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:12,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:12,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 17:46:12,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:12,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34320495] [2022-07-21 17:46:12,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34320495] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:12,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801332330] [2022-07-21 17:46:12,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:12,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:12,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:12,253 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) [2022-07-21 17:46:12,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 17:46:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:12,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 17:46:12,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:12,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:12,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:12,569 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:46:12,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:12,662 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:46:12,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:46:12,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:46:13,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801332330] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:13,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:46:13,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2022-07-21 17:46:13,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368564477] [2022-07-21 17:46:13,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:46:13,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 17:46:13,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:13,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 17:46:13,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:46:13,014 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 17:46:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:13,221 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-07-21 17:46:13,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:46:13,222 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-07-21 17:46:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:13,223 INFO L225 Difference]: With dead ends: 127 [2022-07-21 17:46:13,223 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 17:46:13,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-07-21 17:46:13,224 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 182 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:13,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 400 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 204 Invalid, 0 Unknown, 177 Unchecked, 0.1s Time] [2022-07-21 17:46:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 17:46:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2022-07-21 17:46:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.621212121212121) internal successors, (107), 100 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2022-07-21 17:46:13,229 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 37 [2022-07-21 17:46:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:13,229 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2022-07-21 17:46:13,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 17:46:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-07-21 17:46:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:46:13,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:13,230 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] [2022-07-21 17:46:13,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:46:13,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 [2022-07-21 17:46:13,431 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2022-07-21 17:46:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:13,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107533834] [2022-07-21 17:46:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:13,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 17:46:13,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:13,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107533834] [2022-07-21 17:46:13,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107533834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:13,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:13,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:46:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675973855] [2022-07-21 17:46:13,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:13,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:46:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:13,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:46:13,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:46:13,671 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:13,914 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-07-21 17:46:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:46:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-07-21 17:46:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:13,916 INFO L225 Difference]: With dead ends: 116 [2022-07-21 17:46:13,916 INFO L226 Difference]: Without dead ends: 116 [2022-07-21 17:46:13,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:46:13,917 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 184 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:13,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 204 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:46:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-21 17:46:13,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-07-21 17:46:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.5) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-07-21 17:46:13,922 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 37 [2022-07-21 17:46:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:13,922 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-07-21 17:46:13,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-07-21 17:46:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:46:13,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:13,923 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] [2022-07-21 17:46:13,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:46:13,924 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2022-07-21 17:46:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:13,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238607106] [2022-07-21 17:46:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:13,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:13,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 17:46:13,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:13,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238607106] [2022-07-21 17:46:13,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238607106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:14,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:14,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:46:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522697088] [2022-07-21 17:46:14,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:14,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:46:14,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:14,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:46:14,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:46:14,001 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-07-21 17:46:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:14,145 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2022-07-21 17:46:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:46:14,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 39 [2022-07-21 17:46:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:14,146 INFO L225 Difference]: With dead ends: 114 [2022-07-21 17:46:14,146 INFO L226 Difference]: Without dead ends: 114 [2022-07-21 17:46:14,147 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 [2022-07-21 17:46:14,147 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 69 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:14,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 266 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:46:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-21 17:46:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-07-21 17:46:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-07-21 17:46:14,152 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 39 [2022-07-21 17:46:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:14,152 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-07-21 17:46:14,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-07-21 17:46:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-07-21 17:46:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:46:14,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:14,154 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] [2022-07-21 17:46:14,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:46:14,154 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:14,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:14,155 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2022-07-21 17:46:14,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:14,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055655382] [2022-07-21 17:46:14,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:14,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:14,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 17:46:14,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:14,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055655382] [2022-07-21 17:46:14,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055655382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:14,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:14,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:46:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928137209] [2022-07-21 17:46:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:14,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:46:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:14,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:46:14,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:46:14,260 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (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) [2022-07-21 17:46:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:14,395 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-07-21 17:46:14,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:46:14,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (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 39 [2022-07-21 17:46:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:14,396 INFO L225 Difference]: With dead ends: 94 [2022-07-21 17:46:14,396 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:46:14,396 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 [2022-07-21 17:46:14,397 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 70 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:14,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 281 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:46:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:46:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 17:46:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-07-21 17:46:14,400 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 39 [2022-07-21 17:46:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:14,400 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-07-21 17:46:14,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (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) [2022-07-21 17:46:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-07-21 17:46:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:46:14,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:14,401 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] [2022-07-21 17:46:14,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 17:46:14,401 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:14,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2022-07-21 17:46:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:14,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837369421] [2022-07-21 17:46:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:14,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:14,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:14,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 17:46:14,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:14,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837369421] [2022-07-21 17:46:14,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837369421] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:14,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697176088] [2022-07-21 17:46:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:14,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:14,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:14,737 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) [2022-07-21 17:46:14,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 17:46:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:14,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-21 17:46:14,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:15,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:15,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:15,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:15,214 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 17:46:15,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:46:15,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 17:46:15,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:46:15,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697176088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:15,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:46:15,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-07-21 17:46:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061757853] [2022-07-21 17:46:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:15,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:46:15,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:15,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:46:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=622, Unknown=2, NotChecked=0, Total=702 [2022-07-21 17:46:15,304 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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) [2022-07-21 17:46:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:15,564 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2022-07-21 17:46:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:46:15,565 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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 41 [2022-07-21 17:46:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:15,566 INFO L225 Difference]: With dead ends: 137 [2022-07-21 17:46:15,566 INFO L226 Difference]: Without dead ends: 137 [2022-07-21 17:46:15,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=756, Unknown=2, NotChecked=0, Total=870 [2022-07-21 17:46:15,567 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:15,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 692 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 379 Invalid, 0 Unknown, 138 Unchecked, 0.2s Time] [2022-07-21 17:46:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-21 17:46:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2022-07-21 17:46:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 87 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-07-21 17:46:15,571 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 41 [2022-07-21 17:46:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:15,571 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-07-21 17:46:15,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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) [2022-07-21 17:46:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-07-21 17:46:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:46:15,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:15,572 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] [2022-07-21 17:46:15,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:46:15,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:15,787 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:15,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash -372386586, now seen corresponding path program 1 times [2022-07-21 17:46:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:15,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570385049] [2022-07-21 17:46:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:16,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:46:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:16,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570385049] [2022-07-21 17:46:16,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570385049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:16,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685221753] [2022-07-21 17:46:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:16,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:16,265 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) [2022-07-21 17:46:16,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 17:46:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:16,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-21 17:46:16,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:16,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:16,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:16,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:16,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:16,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:16,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:16,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:16,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:16,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:17,008 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:46:17,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:17,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:17,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:46:17,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:46:17,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_node_create_~temp~0#1.base_35| Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (or (not (< |v_node_create_~temp~0#1.base_35| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_35|) 0)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_35| v_ArrVal_1150) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (<= (+ .cse0 4) (select (store |c_#length| |v_node_create_~temp~0#1.base_35| v_ArrVal_1152) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_35| v_ArrVal_1151) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (<= 0 .cse0))))) is different from false [2022-07-21 17:46:17,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685221753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:17,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:46:17,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-07-21 17:46:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138372534] [2022-07-21 17:46:17,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:46:17,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-21 17:46:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-21 17:46:17,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1073, Unknown=3, NotChecked=66, Total=1260 [2022-07-21 17:46:17,254 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:46:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:18,337 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2022-07-21 17:46:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:46:18,337 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-07-21 17:46:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:18,338 INFO L225 Difference]: With dead ends: 147 [2022-07-21 17:46:18,338 INFO L226 Difference]: Without dead ends: 147 [2022-07-21 17:46:18,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=243, Invalid=1920, Unknown=3, NotChecked=90, Total=2256 [2022-07-21 17:46:18,340 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 258 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:18,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1228 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1375 Invalid, 0 Unknown, 76 Unchecked, 0.7s Time] [2022-07-21 17:46:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-21 17:46:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 97. [2022-07-21 17:46:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-07-21 17:46:18,343 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 41 [2022-07-21 17:46:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:18,343 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-07-21 17:46:18,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:46:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-07-21 17:46:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:46:18,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:18,344 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] [2022-07-21 17:46:18,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:46:18,555 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,SelfDestructingSolverStorable12 [2022-07-21 17:46:18,556 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:18,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1333284459, now seen corresponding path program 1 times [2022-07-21 17:46:18,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:18,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779802454] [2022-07-21 17:46:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:18,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:18,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:18,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 17:46:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:18,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779802454] [2022-07-21 17:46:18,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779802454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:18,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:18,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:46:18,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449774110] [2022-07-21 17:46:18,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:18,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:46:18,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:18,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:46:18,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:46:18,638 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-07-21 17:46:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:18,709 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-07-21 17:46:18,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:46:18,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 42 [2022-07-21 17:46:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:18,710 INFO L225 Difference]: With dead ends: 114 [2022-07-21 17:46:18,711 INFO L226 Difference]: Without dead ends: 114 [2022-07-21 17:46:18,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:46:18,711 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 83 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:18,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 177 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:46:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-21 17:46:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-07-21 17:46:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.380281690140845) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-07-21 17:46:18,715 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 42 [2022-07-21 17:46:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:18,715 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-07-21 17:46:18,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-07-21 17:46:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-07-21 17:46:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:46:18,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:18,716 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] [2022-07-21 17:46:18,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 17:46:18,717 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:18,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:18,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112687, now seen corresponding path program 1 times [2022-07-21 17:46:18,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:18,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021149073] [2022-07-21 17:46:18,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:18,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:18,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:18,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:18,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 17:46:18,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:18,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021149073] [2022-07-21 17:46:18,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021149073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:18,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:18,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:46:18,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263968109] [2022-07-21 17:46:18,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:18,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:46:18,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:18,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:46:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:46:18,837 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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) [2022-07-21 17:46:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:19,053 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2022-07-21 17:46:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 17:46:19,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 44 [2022-07-21 17:46:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:19,056 INFO L225 Difference]: With dead ends: 159 [2022-07-21 17:46:19,056 INFO L226 Difference]: Without dead ends: 159 [2022-07-21 17:46:19,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:46:19,058 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 268 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:19,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 398 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:46:19,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-21 17:46:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 99. [2022-07-21 17:46:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.36) internal successors, (102), 93 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-07-21 17:46:19,064 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 44 [2022-07-21 17:46:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:19,064 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-07-21 17:46:19,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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) [2022-07-21 17:46:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-07-21 17:46:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:46:19,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:19,066 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] [2022-07-21 17:46:19,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 17:46:19,066 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112688, now seen corresponding path program 1 times [2022-07-21 17:46:19,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:19,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241443315] [2022-07-21 17:46:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:19,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:19,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:19,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 17:46:19,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:19,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241443315] [2022-07-21 17:46:19,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241443315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:46:19,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:46:19,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:46:19,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668092521] [2022-07-21 17:46:19,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:46:19,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:46:19,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:19,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:46:19,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:46:19,270 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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) [2022-07-21 17:46:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:19,510 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-07-21 17:46:19,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:46:19,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 44 [2022-07-21 17:46:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:19,512 INFO L225 Difference]: With dead ends: 141 [2022-07-21 17:46:19,512 INFO L226 Difference]: Without dead ends: 141 [2022-07-21 17:46:19,512 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 [2022-07-21 17:46:19,512 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 275 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:19,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 400 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:46:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-21 17:46:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2022-07-21 17:46:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 95 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-07-21 17:46:19,516 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 44 [2022-07-21 17:46:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:19,516 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-07-21 17:46:19,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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) [2022-07-21 17:46:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-07-21 17:46:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:46:19,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:19,516 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] [2022-07-21 17:46:19,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 17:46:19,517 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:19,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash 614432594, now seen corresponding path program 1 times [2022-07-21 17:46:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:19,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222760114] [2022-07-21 17:46:19,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:19,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:19,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:46:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:19,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222760114] [2022-07-21 17:46:19,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222760114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:19,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626077114] [2022-07-21 17:46:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:19,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:19,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:19,794 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) [2022-07-21 17:46:19,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 17:46:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:19,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 17:46:19,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:20,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:20,213 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 17:46:20,269 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1662 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1662)))) is different from true [2022-07-21 17:46:20,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:20,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-21 17:46:20,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 17:46:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-07-21 17:46:20,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:46:20,413 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1666 (Array Int Int)) (|v_node_create_~temp~0#1.base_38| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_38| v_ArrVal_1666) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (<= 1 .cse0) (not (< |v_node_create_~temp~0#1.base_38| |c_#StackHeapBarrier|)) (<= (+ .cse0 1) 0)))) is different from false [2022-07-21 17:46:20,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626077114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:20,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:46:20,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-07-21 17:46:20,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114034155] [2022-07-21 17:46:20,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:46:20,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 17:46:20,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:20,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 17:46:20,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-07-21 17:46:20,416 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 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) [2022-07-21 17:46:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:20,917 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-07-21 17:46:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:46:20,917 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 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 46 [2022-07-21 17:46:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:20,918 INFO L225 Difference]: With dead ends: 97 [2022-07-21 17:46:20,918 INFO L226 Difference]: Without dead ends: 97 [2022-07-21 17:46:20,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2022-07-21 17:46:20,919 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 292 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:20,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 580 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 439 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2022-07-21 17:46:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-21 17:46:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-07-21 17:46:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:46:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-07-21 17:46:20,923 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 46 [2022-07-21 17:46:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:20,923 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-07-21 17:46:20,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 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) [2022-07-21 17:46:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-07-21 17:46:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:46:20,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:20,924 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] [2022-07-21 17:46:20,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 17:46:21,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 17:46:21,148 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450120, now seen corresponding path program 1 times [2022-07-21 17:46:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:21,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123448774] [2022-07-21 17:46:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:21,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:21,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:46:21,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:21,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123448774] [2022-07-21 17:46:21,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123448774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:21,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869689366] [2022-07-21 17:46:21,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:21,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:21,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:21,831 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) [2022-07-21 17:46:21,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 17:46:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:21,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-21 17:46:21,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:22,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:22,187 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:46:22,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:22,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:46:22,368 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:46:22,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-21 17:46:22,521 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:46:22,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 22 [2022-07-21 17:46:22,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 17:46:22,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:22,763 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:46:22,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-07-21 17:46:22,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:22,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:22,803 INFO L356 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-07-21 17:46:22,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2022-07-21 17:46:22,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:23,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:46:23,225 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:46:23,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 36 [2022-07-21 17:46:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:46:23,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:46:23,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (|v_node_create_~temp~0#1.base_41| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_41| v_ArrVal_1838) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_41|) 0)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_41| 1) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_41| v_ArrVal_1837))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) .cse1)) 1) (not (< |v_node_create_~temp~0#1.base_41| |c_#StackHeapBarrier|)) (< .cse1 0)))) is different from false [2022-07-21 17:46:23,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869689366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:23,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:46:23,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2022-07-21 17:46:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146787395] [2022-07-21 17:46:23,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:46:23,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-21 17:46:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-21 17:46:23,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2475, Unknown=3, NotChecked=100, Total=2756 [2022-07-21 17:46:23,539 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:46:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:24,433 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-07-21 17:46:24,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 17:46:24,433 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-21 17:46:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:24,434 INFO L225 Difference]: With dead ends: 115 [2022-07-21 17:46:24,434 INFO L226 Difference]: Without dead ends: 115 [2022-07-21 17:46:24,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=296, Invalid=3862, Unknown=6, NotChecked=126, Total=4290 [2022-07-21 17:46:24,436 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:24,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1033 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 573 Invalid, 0 Unknown, 237 Unchecked, 0.3s Time] [2022-07-21 17:46:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-21 17:46:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-07-21 17:46:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 105 states have internal predecessors, (115), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 17:46:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-07-21 17:46:24,448 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 46 [2022-07-21 17:46:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:24,448 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-07-21 17:46:24,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:46:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-07-21 17:46:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:46:24,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:24,449 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] [2022-07-21 17:46:24,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 17:46:24,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:24,649 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:24,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450121, now seen corresponding path program 1 times [2022-07-21 17:46:24,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:24,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372458951] [2022-07-21 17:46:24,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:24,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:25,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:25,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:46:25,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:25,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372458951] [2022-07-21 17:46:25,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372458951] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:25,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999611876] [2022-07-21 17:46:25,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:25,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:25,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:25,549 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) [2022-07-21 17:46:25,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 17:46:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:25,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-21 17:46:25,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:25,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:26,053 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:46:26,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:46:26,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:46:26,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:46:26,334 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:46:26,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 44 [2022-07-21 17:46:26,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:26,541 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:46:26,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 [2022-07-21 17:46:26,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:46:26,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:46:26,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:46:26,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:26,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 17:46:26,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:26,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:26,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:26,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:46:26,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:26,863 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:46:26,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-07-21 17:46:26,878 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 17:46:26,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 17:46:27,156 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:46:27,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2022-07-21 17:46:27,164 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:46:27,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-21 17:46:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:46:27,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:46:27,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2016 Int) (|v_node_create_~temp~0#1.base_44| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_44| v_ArrVal_2015))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_44| v_ArrVal_2014))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select .cse4 .cse2) .cse3))) (and (<= (+ .cse0 4) (select (store |c_#length| |v_node_create_~temp~0#1.base_44| v_ArrVal_2016) (select (select .cse1 .cse2) .cse3))) (<= 0 .cse0))))) (< .cse3 0) (not (< |v_node_create_~temp~0#1.base_44| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_44|) 0)))))) is different from false [2022-07-21 17:46:27,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999611876] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:27,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:46:27,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2022-07-21 17:46:27,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005836329] [2022-07-21 17:46:27,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:46:27,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-21 17:46:27,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:27,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-21 17:46:27,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3117, Unknown=7, NotChecked=112, Total=3422 [2022-07-21 17:46:27,675 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 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) [2022-07-21 17:46:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:29,608 INFO L93 Difference]: Finished difference Result 220 states and 240 transitions. [2022-07-21 17:46:29,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 17:46:29,609 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 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 46 [2022-07-21 17:46:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:29,609 INFO L225 Difference]: With dead ends: 220 [2022-07-21 17:46:29,610 INFO L226 Difference]: Without dead ends: 220 [2022-07-21 17:46:29,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=369, Invalid=5175, Unknown=10, NotChecked=146, Total=5700 [2022-07-21 17:46:29,612 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 192 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:29,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1803 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1301 Invalid, 0 Unknown, 355 Unchecked, 0.7s Time] [2022-07-21 17:46:29,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-21 17:46:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 112. [2022-07-21 17:46:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.313953488372093) internal successors, (113), 104 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 17:46:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2022-07-21 17:46:29,616 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 46 [2022-07-21 17:46:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:29,617 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2022-07-21 17:46:29,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 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) [2022-07-21 17:46:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-07-21 17:46:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 17:46:29,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:29,618 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] [2022-07-21 17:46:29,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-21 17:46:29,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:29,831 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash 865523061, now seen corresponding path program 1 times [2022-07-21 17:46:29,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:29,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811947166] [2022-07-21 17:46:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:29,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:30,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:46:30,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:30,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811947166] [2022-07-21 17:46:30,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811947166] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:30,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257130706] [2022-07-21 17:46:30,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:30,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:30,408 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) [2022-07-21 17:46:30,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 17:46:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:30,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-21 17:46:30,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:30,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:30,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:30,694 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:46:30,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:30,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:30,808 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:46:30,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:31,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 10 [2022-07-21 17:46:31,242 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-21 17:46:31,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-21 17:46:31,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:31,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 30 [2022-07-21 17:46:31,486 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:46:31,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 35 [2022-07-21 17:46:31,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:31,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 30 [2022-07-21 17:46:31,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 17:46:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:46:31,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:46:31,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2200) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-07-21 17:46:31,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2207 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| Int) (v_ArrVal_2208 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_2208) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_2207))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2200)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_2201) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1))) is different from false [2022-07-21 17:46:31,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257130706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:31,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:46:31,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2022-07-21 17:46:31,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677537931] [2022-07-21 17:46:31,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:46:31,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 17:46:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:31,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 17:46:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2107, Unknown=105, NotChecked=190, Total=2550 [2022-07-21 17:46:31,957 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:46:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:33,739 INFO L93 Difference]: Finished difference Result 320 states and 348 transitions. [2022-07-21 17:46:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-21 17:46:33,740 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-07-21 17:46:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:33,742 INFO L225 Difference]: With dead ends: 320 [2022-07-21 17:46:33,742 INFO L226 Difference]: Without dead ends: 320 [2022-07-21 17:46:33,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=427, Invalid=5308, Unknown=125, NotChecked=302, Total=6162 [2022-07-21 17:46:33,745 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 725 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:33,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1360 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1389 Invalid, 0 Unknown, 237 Unchecked, 0.6s Time] [2022-07-21 17:46:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-21 17:46:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 147. [2022-07-21 17:46:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 119 states have (on average 1.3025210084033614) internal successors, (155), 137 states have internal predecessors, (155), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 17:46:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2022-07-21 17:46:33,757 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 51 [2022-07-21 17:46:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:33,757 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2022-07-21 17:46:33,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:46:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2022-07-21 17:46:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 17:46:33,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:33,759 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] [2022-07-21 17:46:33,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 17:46:33,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:33,967 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:33,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:33,968 INFO L85 PathProgramCache]: Analyzing trace with hash 865523062, now seen corresponding path program 1 times [2022-07-21 17:46:33,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:33,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509249348] [2022-07-21 17:46:33,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:33,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:34,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:34,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:46:34,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:34,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509249348] [2022-07-21 17:46:34,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509249348] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:34,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544360813] [2022-07-21 17:46:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:34,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:34,784 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) [2022-07-21 17:46:34,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 17:46:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:34,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-21 17:46:34,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:34,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:35,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:35,122 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:46:35,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:35,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:35,249 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:46:35,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:35,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-21 17:46:35,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-21 17:46:35,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:35,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-07-21 17:46:35,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:35,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 17:46:35,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:35,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:35,822 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:46:35,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 17:46:36,156 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:46:36,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 49 [2022-07-21 17:46:36,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-21 17:46:36,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:36,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-21 17:46:36,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:36,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-07-21 17:46:36,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 19 [2022-07-21 17:46:36,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-21 17:46:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:46:36,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:46:36,582 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-21 17:46:36,596 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2395) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 17:46:36,622 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2395) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 17:46:36,632 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2395) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-21 17:46:36,663 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2395) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 17:46:36,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2408 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22|) 0)) (and (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_2406) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_2407) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2394) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_2407))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (<= (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_2406) .cse0 v_ArrVal_2394) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_2408) (select (select (store (store .cse1 .cse0 v_ArrVal_2395) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| |c_#StackHeapBarrier|)))) is different from false [2022-07-21 17:46:36,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544360813] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:36,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:46:36,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2022-07-21 17:46:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380246571] [2022-07-21 17:46:36,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:46:36,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-21 17:46:36,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:46:36,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-21 17:46:36,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2486, Unknown=7, NotChecked=630, Total=3306 [2022-07-21 17:46:36,751 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand has 49 states, 46 states have (on average 1.934782608695652) internal successors, (89), 42 states have internal predecessors, (89), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:46:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:46:38,501 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2022-07-21 17:46:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 17:46:38,502 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.934782608695652) internal successors, (89), 42 states have internal predecessors, (89), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-07-21 17:46:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:46:38,503 INFO L225 Difference]: With dead ends: 260 [2022-07-21 17:46:38,503 INFO L226 Difference]: Without dead ends: 260 [2022-07-21 17:46:38,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=409, Invalid=4860, Unknown=11, NotChecked=882, Total=6162 [2022-07-21 17:46:38,504 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 561 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:46:38,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1411 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1398 Invalid, 0 Unknown, 94 Unchecked, 0.7s Time] [2022-07-21 17:46:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-21 17:46:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 164. [2022-07-21 17:46:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 154 states have internal predecessors, (174), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 17:46:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 188 transitions. [2022-07-21 17:46:38,511 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 188 transitions. Word has length 51 [2022-07-21 17:46:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:46:38,512 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 188 transitions. [2022-07-21 17:46:38,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.934782608695652) internal successors, (89), 42 states have internal predecessors, (89), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:46:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 188 transitions. [2022-07-21 17:46:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 17:46:38,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:46:38,513 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:46:38,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:46:38,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-21 17:46:38,713 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:46:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:46:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash -396596539, now seen corresponding path program 2 times [2022-07-21 17:46:38,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:46:38,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933674685] [2022-07-21 17:46:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:46:38,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:46:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:39,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:46:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:46:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:39,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:46:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:46:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:46:39,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:46:39,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933674685] [2022-07-21 17:46:39,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933674685] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:46:39,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165458460] [2022-07-21 17:46:39,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:46:39,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:46:39,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:46:39,370 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) [2022-07-21 17:46:39,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 17:46:39,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:46:39,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:46:39,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 133 conjunts are in the unsatisfiable core [2022-07-21 17:46:39,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:46:39,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:39,782 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:46:39,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:39,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:46:39,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:46:39,980 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 17:46:39,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 33 [2022-07-21 17:46:39,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:46:58,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:58,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:58,370 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 17:46:58,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2022-07-21 17:46:58,400 INFO L356 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-07-21 17:46:58,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 70 [2022-07-21 17:46:58,416 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-21 17:46:58,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 17:46:59,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:46:59,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:59,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:46:59,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:46:59,498 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:46:59,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 30 [2022-07-21 17:46:59,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:46:59,790 INFO L356 Elim1Store]: treesize reduction 142, result has 13.4 percent of original size [2022-07-21 17:46:59,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 78 treesize of output 60 [2022-07-21 17:46:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:46:59,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:46:59,921 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-07-21 17:46:59,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 23 [2022-07-21 17:47:00,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165458460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:00,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:47:00,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2022-07-21 17:47:00,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897267618] [2022-07-21 17:47:00,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:47:00,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-21 17:47:00,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:47:00,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-21 17:47:00,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3686, Unknown=9, NotChecked=0, Total=3906 [2022-07-21 17:47:00,253 INFO L87 Difference]: Start difference. First operand 164 states and 188 transitions. Second operand has 59 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 52 states have internal predecessors, (89), 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) [2022-07-21 17:47:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:47:15,631 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2022-07-21 17:47:15,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-21 17:47:15,631 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 52 states have internal predecessors, (89), 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 [2022-07-21 17:47:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:47:15,632 INFO L225 Difference]: With dead ends: 169 [2022-07-21 17:47:15,632 INFO L226 Difference]: Without dead ends: 169 [2022-07-21 17:47:15,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=368, Invalid=5781, Unknown=13, NotChecked=0, Total=6162 [2022-07-21 17:47:15,634 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 40 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:47:15,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1379 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 840 Invalid, 0 Unknown, 140 Unchecked, 0.4s Time] [2022-07-21 17:47:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-21 17:47:15,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2022-07-21 17:47:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 156 states have internal predecessors, (177), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 17:47:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2022-07-21 17:47:15,639 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 51 [2022-07-21 17:47:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:47:15,639 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2022-07-21 17:47:15,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 52 states have internal predecessors, (89), 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) [2022-07-21 17:47:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2022-07-21 17:47:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 17:47:15,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:47:15,640 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:47:15,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-21 17:47:15,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-21 17:47:15,847 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:47:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:47:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash -396596538, now seen corresponding path program 2 times [2022-07-21 17:47:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:47:15,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443968596] [2022-07-21 17:47:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:47:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:47:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:47:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:47:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:47:16,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:47:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443968596] [2022-07-21 17:47:16,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443968596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213253129] [2022-07-21 17:47:16,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:47:16,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:47:16,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:47:16,664 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) [2022-07-21 17:47:16,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 17:47:16,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:47:16,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:47:16,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 136 conjunts are in the unsatisfiable core [2022-07-21 17:47:16,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:47:16,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:16,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:17,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:17,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:17,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:17,217 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-21 17:47:17,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-21 17:47:17,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:47:17,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:47:17,503 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 17:47:17,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-21 17:47:17,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 22 [2022-07-21 17:47:18,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:18,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:18,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:18,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:18,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:18,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2022-07-21 17:47:18,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:18,064 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 17:47:18,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 85 [2022-07-21 17:47:18,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:18,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:18,085 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-21 17:47:18,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-07-21 17:47:18,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:47:18,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:47:18,810 INFO L356 Elim1Store]: treesize reduction 90, result has 10.9 percent of original size [2022-07-21 17:47:18,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 144 treesize of output 81 [2022-07-21 17:47:18,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:18,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:47:18,824 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-21 17:47:18,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 31 [2022-07-21 17:47:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:47:18,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:47:19,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213253129] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:19,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:47:19,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2022-07-21 17:47:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658435358] [2022-07-21 17:47:19,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:47:19,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-21 17:47:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:47:19,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-21 17:47:19,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3443, Unknown=10, NotChecked=0, Total=3660 [2022-07-21 17:47:19,358 INFO L87 Difference]: Start difference. First operand 166 states and 191 transitions. Second operand has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:47:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:47:21,607 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2022-07-21 17:47:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 17:47:21,608 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-07-21 17:47:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:47:21,609 INFO L225 Difference]: With dead ends: 158 [2022-07-21 17:47:21,609 INFO L226 Difference]: Without dead ends: 158 [2022-07-21 17:47:21,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=440, Invalid=5870, Unknown=10, NotChecked=0, Total=6320 [2022-07-21 17:47:21,611 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 75 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:47:21,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1788 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1405 Invalid, 0 Unknown, 159 Unchecked, 0.8s Time] [2022-07-21 17:47:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-21 17:47:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-07-21 17:47:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 129 states have (on average 1.248062015503876) internal successors, (161), 147 states have internal predecessors, (161), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 17:47:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2022-07-21 17:47:21,615 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 51 [2022-07-21 17:47:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:47:21,616 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2022-07-21 17:47:21,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:47:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2022-07-21 17:47:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 17:47:21,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:47:21,617 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] [2022-07-21 17:47:21,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 17:47:21,819 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,SelfDestructingSolverStorable22 [2022-07-21 17:47:21,819 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:47:21,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:47:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1455991656, now seen corresponding path program 1 times [2022-07-21 17:47:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:47:21,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517736317] [2022-07-21 17:47:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:47:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:47:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:22,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:47:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:22,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:47:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:47:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:47:22,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517736317] [2022-07-21 17:47:22,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517736317] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:22,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067504711] [2022-07-21 17:47:22,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:22,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:47:22,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:47:22,468 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) [2022-07-21 17:47:22,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 17:47:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:22,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-21 17:47:22,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:47:22,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:22,950 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:47:22,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:23,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:47:23,194 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:47:23,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 22 [2022-07-21 17:47:23,328 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:47:23,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 16 [2022-07-21 17:47:23,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:23,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:23,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:23,511 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-21 17:47:23,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2022-07-21 17:47:23,517 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:47:23,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:23,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:23,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-07-21 17:47:23,878 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-21 17:47:23,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 29 [2022-07-21 17:47:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:47:23,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:47:24,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2963 (Array Int Int)) (v_ArrVal_2962 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| Int)) (or (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_2963))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_2962) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| |c_#StackHeapBarrier|)))) is different from false [2022-07-21 17:47:24,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067504711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:24,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:47:24,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2022-07-21 17:47:24,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737742690] [2022-07-21 17:47:24,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:47:24,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-21 17:47:24,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:47:24,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-21 17:47:24,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2482, Unknown=1, NotChecked=100, Total=2756 [2022-07-21 17:47:24,132 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:47:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:47:25,696 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2022-07-21 17:47:25,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 17:47:25,696 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-07-21 17:47:25,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:47:25,697 INFO L225 Difference]: With dead ends: 157 [2022-07-21 17:47:25,697 INFO L226 Difference]: Without dead ends: 157 [2022-07-21 17:47:25,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=336, Invalid=4089, Unknown=1, NotChecked=130, Total=4556 [2022-07-21 17:47:25,698 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 219 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:47:25,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1520 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1569 Invalid, 0 Unknown, 62 Unchecked, 0.8s Time] [2022-07-21 17:47:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-21 17:47:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-07-21 17:47:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 129 states have (on average 1.2403100775193798) internal successors, (160), 147 states have internal predecessors, (160), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 17:47:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2022-07-21 17:47:25,708 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 53 [2022-07-21 17:47:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:47:25,709 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2022-07-21 17:47:25,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:47:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2022-07-21 17:47:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-21 17:47:25,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:47:25,710 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:47:25,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-21 17:47:25,931 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,SelfDestructingSolverStorable23 [2022-07-21 17:47:25,931 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:47:25,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:47:25,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1874385561, now seen corresponding path program 1 times [2022-07-21 17:47:25,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:47:25,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286478240] [2022-07-21 17:47:25,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:25,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:47:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:47:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:26,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:47:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:47:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:47:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:47:27,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286478240] [2022-07-21 17:47:27,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286478240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:27,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599147848] [2022-07-21 17:47:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:27,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:47:27,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:47:27,300 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) [2022-07-21 17:47:27,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 17:47:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:27,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-21 17:47:27,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:47:27,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:27,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:27,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:27,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:27,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:27,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:27,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:28,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:28,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:28,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:28,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:47:28,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:28,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:28,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:28,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:28,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:28,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:28,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-21 17:47:28,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:28,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 32 [2022-07-21 17:47:28,730 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:47:28,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:29,424 INFO L356 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-07-21 17:47:29,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 57 [2022-07-21 17:47:29,440 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-21 17:47:29,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 33 [2022-07-21 17:47:29,809 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-21 17:47:29,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 62 [2022-07-21 17:47:29,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:29,827 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-21 17:47:29,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2022-07-21 17:47:29,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:29,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 18 [2022-07-21 17:47:31,201 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:47:31,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 57 [2022-07-21 17:47:31,210 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 17:47:31,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 41 [2022-07-21 17:47:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:47:32,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:47:32,751 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3155 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3154) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_3155 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-21 17:47:32,770 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3155 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3155) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3154) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 17:47:44,467 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3164 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (v_ArrVal_3166 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| Int) (v_ArrVal_3165 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3164) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 8 v_ArrVal_3165)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (< .cse0 0) (not (<= (+ .cse0 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3165) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|))) (and (forall ((v_ArrVal_3155 (Array Int Int))) (<= 0 (+ (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3164))) (store .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| (store (select .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) (select (select .cse1 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3155) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_3154 (Array Int Int)) (v_ArrVal_3155 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3164))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (<= (+ (select (select (store (store .cse2 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| (store (select .cse2 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) .cse3 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3155) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3165) (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3166))) (store .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30| (store (select .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_30|) .cse3 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3154) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0))))) is different from false [2022-07-21 17:47:44,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599147848] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:44,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:47:44,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27] total 58 [2022-07-21 17:47:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319900220] [2022-07-21 17:47:44,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:47:44,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-21 17:47:44,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:47:44,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-21 17:47:44,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=4236, Unknown=13, NotChecked=402, Total=4970 [2022-07-21 17:47:44,472 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 51 states have internal predecessors, (99), 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) [2022-07-21 17:47:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:47:47,146 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2022-07-21 17:47:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-21 17:47:47,147 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.8) internal successors, (99), 51 states have internal predecessors, (99), 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 56 [2022-07-21 17:47:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:47:47,148 INFO L225 Difference]: With dead ends: 160 [2022-07-21 17:47:47,148 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 17:47:47,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2118 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=657, Invalid=7898, Unknown=13, NotChecked=552, Total=9120 [2022-07-21 17:47:47,149 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 121 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 368 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:47:47,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1172 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 952 Invalid, 0 Unknown, 368 Unchecked, 0.6s Time] [2022-07-21 17:47:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 17:47:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-07-21 17:47:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 148 states have internal predecessors, (161), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 17:47:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2022-07-21 17:47:47,161 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 56 [2022-07-21 17:47:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:47:47,162 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2022-07-21 17:47:47,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.8) internal successors, (99), 51 states have internal predecessors, (99), 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) [2022-07-21 17:47:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2022-07-21 17:47:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 17:47:47,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:47:47,163 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:47:47,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 17:47:47,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:47:47,371 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:47:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:47:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1773529958, now seen corresponding path program 3 times [2022-07-21 17:47:47,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:47:47,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550283989] [2022-07-21 17:47:47,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:47,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:47:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:47,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:47:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:47,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:47:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 17:47:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 17:47:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-21 17:47:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:47:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550283989] [2022-07-21 17:47:47,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550283989] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173597311] [2022-07-21 17:47:47,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 17:47:47,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:47:47,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:47:47,443 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) [2022-07-21 17:47:47,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-21 17:47:47,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 17:47:47,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:47:47,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:47:47,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:47:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:47:47,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:47:47,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173597311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:47:47,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:47:47,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-21 17:47:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125212130] [2022-07-21 17:47:47,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:47:47,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:47:47,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:47:47,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:47:47,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:47:47,750 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:47:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:47:47,769 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-07-21 17:47:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:47:47,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-07-21 17:47:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:47:47,770 INFO L225 Difference]: With dead ends: 88 [2022-07-21 17:47:47,770 INFO L226 Difference]: Without dead ends: 88 [2022-07-21 17:47:47,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:47:47,771 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 128 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:47:47,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 93 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:47:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-21 17:47:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-21 17:47:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:47:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-07-21 17:47:47,774 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 58 [2022-07-21 17:47:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:47:47,774 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-07-21 17:47:47,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:47:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-07-21 17:47:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 17:47:47,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:47:47,775 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:47:47,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-21 17:47:47,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-21 17:47:48,000 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:47:48,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:47:48,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228282, now seen corresponding path program 1 times [2022-07-21 17:47:48,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:47:48,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399132333] [2022-07-21 17:47:48,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:48,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:47:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:48,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:47:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:47:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:48,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:47:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:47:48,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:47:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399132333] [2022-07-21 17:47:48,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399132333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111875562] [2022-07-21 17:47:48,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:48,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:47:48,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:47:48,482 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:47:48,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-21 17:47:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:48,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:47:48,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:47:48,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:48,842 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3553 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_3553)))) is different from true [2022-07-21 17:47:48,846 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3554 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_3554) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-21 17:47:48,850 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3554 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_3554) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-21 17:47:48,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:48,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:48,943 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-21 17:47:48,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:49,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:49,014 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-21 17:47:49,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 38 [2022-07-21 17:47:49,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 17:47:49,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:47:49,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111875562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:47:49,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:47:49,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [22] total 38 [2022-07-21 17:47:49,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183589152] [2022-07-21 17:47:49,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:47:49,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 17:47:49,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:47:49,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 17:47:49,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1149, Unknown=3, NotChecked=210, Total=1482 [2022-07-21 17:47:49,131 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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) [2022-07-21 17:47:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:47:49,356 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-07-21 17:47:49,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:47:49,357 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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 58 [2022-07-21 17:47:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:47:49,357 INFO L225 Difference]: With dead ends: 93 [2022-07-21 17:47:49,357 INFO L226 Difference]: Without dead ends: 93 [2022-07-21 17:47:49,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=1575, Unknown=3, NotChecked=246, Total=1980 [2022-07-21 17:47:49,358 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 79 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:47:49,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 554 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 290 Invalid, 0 Unknown, 285 Unchecked, 0.1s Time] [2022-07-21 17:47:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-21 17:47:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2022-07-21 17:47:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:47:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-07-21 17:47:49,361 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 58 [2022-07-21 17:47:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:47:49,361 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-07-21 17:47:49,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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) [2022-07-21 17:47:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-07-21 17:47:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 17:47:49,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:47:49,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:47:49,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-21 17:47:49,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-21 17:47:49,587 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:47:49,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:47:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228283, now seen corresponding path program 1 times [2022-07-21 17:47:49,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:47:49,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997196382] [2022-07-21 17:47:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:47:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:50,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:47:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:47:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:47:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:47:51,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:47:51,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997196382] [2022-07-21 17:47:51,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997196382] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:51,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563101216] [2022-07-21 17:47:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:51,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:47:51,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:47:51,259 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:47:51,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-21 17:47:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:51,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 142 conjunts are in the unsatisfiable core [2022-07-21 17:47:51,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:47:51,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:51,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:51,680 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:47:51,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:47:51,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:47:51,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:51,946 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:47:51,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:47:52,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:52,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:47:52,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:47:52,277 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:47:52,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-07-21 17:47:52,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 17:47:52,544 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:47:52,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 28 [2022-07-21 17:47:52,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:47:52,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 17:47:52,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:52,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:52,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:52,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:52,939 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:47:52,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2022-07-21 17:47:52,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:52,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:52,950 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:47:52,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:53,623 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-21 17:47:53,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 83 [2022-07-21 17:47:53,632 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:47:53,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 45 [2022-07-21 17:47:53,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:53,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-07-21 17:47:53,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:53,745 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:47:53,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 50 [2022-07-21 17:47:53,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:53,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:53,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:53,847 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:47:53,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 26 [2022-07-21 17:47:53,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:47:53,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:47:54,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:47:54,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3757) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3755) |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_append_~new_last~0#1.base| v_ArrVal_3756) |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 [2022-07-21 17:47:54,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3752 (Array Int Int)) (v_ArrVal_3753 (Array Int Int)) (v_ArrVal_3754 (Array Int Int)) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3754) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3757) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3753) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3755) |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_append_~last~1#1.base| v_ArrVal_3752) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3756) |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 [2022-07-21 17:47:54,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3752 (Array Int Int)) (v_ArrVal_3753 (Array Int Int)) (v_ArrVal_3754 (Array Int Int)) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3754) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3757) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3753) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3755) |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_append_#t~mem14#1.base| v_ArrVal_3752) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3756) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-21 17:47:54,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3752 (Array Int Int)) (v_ArrVal_3753 (Array Int Int)) (v_ArrVal_3754 (Array Int Int)) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3754) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3757) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3753) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3752) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3756) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-07-21 17:47:54,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3752 (Array Int Int)) (v_ArrVal_3753 (Array Int Int)) (v_ArrVal_3754 (Array Int Int)) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3754) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3757) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3753) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3752) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3756) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-07-21 17:47:54,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3752 (Array Int Int)) (v_ArrVal_3753 (Array Int Int)) (v_ArrVal_3754 (Array Int Int)) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3754) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3757) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3753) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3752) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3756) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-07-21 17:47:54,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3752 (Array Int Int)) (v_ArrVal_3753 (Array Int Int)) (v_ArrVal_3754 (Array Int Int)) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3754) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3757) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3753) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3752) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3756) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-07-21 17:47:54,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| Int) (v_ArrVal_3752 (Array Int Int)) (v_ArrVal_3753 (Array Int Int)) (v_ArrVal_3754 (Array Int Int)) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3767 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3768 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3769 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3768)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3767))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3769) .cse0 v_ArrVal_3754) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3757) (select (select (store (store .cse1 .cse0 v_ArrVal_3753) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_3752) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3756) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|) 0)))) is different from false [2022-07-21 17:47:54,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563101216] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:54,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:47:54,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 65 [2022-07-21 17:47:54,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486932815] [2022-07-21 17:47:54,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:47:54,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-21 17:47:54,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:47:54,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-21 17:47:54,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4325, Unknown=9, NotChecked=1112, Total=5700 [2022-07-21 17:47:54,312 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 65 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 56 states have internal predecessors, (101), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:47:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:47:56,648 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-07-21 17:47:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 17:47:56,649 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 56 states have internal predecessors, (101), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2022-07-21 17:47:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:47:56,649 INFO L225 Difference]: With dead ends: 91 [2022-07-21 17:47:56,649 INFO L226 Difference]: Without dead ends: 91 [2022-07-21 17:47:56,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=471, Invalid=6860, Unknown=11, NotChecked=1400, Total=8742 [2022-07-21 17:47:56,650 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 248 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:47:56,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1443 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1850 Invalid, 0 Unknown, 5 Unchecked, 1.0s Time] [2022-07-21 17:47:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-21 17:47:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-07-21 17:47:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:47:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-07-21 17:47:56,653 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 58 [2022-07-21 17:47:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:47:56,653 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-07-21 17:47:56,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 56 states have internal predecessors, (101), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:47:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-07-21 17:47:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 17:47:56,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:47:56,654 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:47:56,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-21 17:47:56,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 17:47:56,867 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:47:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:47:56,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478905, now seen corresponding path program 1 times [2022-07-21 17:47:56,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:47:56,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206512769] [2022-07-21 17:47:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:56,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:47:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:47:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:57,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:47:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:57,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:47:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:47:57,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:47:57,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206512769] [2022-07-21 17:47:57,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206512769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:47:57,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873835516] [2022-07-21 17:47:57,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:47:57,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:47:57,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:47:57,944 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:47:57,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-21 17:47:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:47:58,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 154 conjunts are in the unsatisfiable core [2022-07-21 17:47:58,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:47:58,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:58,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:58,341 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:47:58,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:47:58,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:47:58,543 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:47:58,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:47:58,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:47:58,804 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:47:58,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-21 17:47:58,992 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:47:58,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 21 [2022-07-21 17:47:58,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 17:47:59,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:59,304 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:47:59,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 42 [2022-07-21 17:47:59,318 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:47:59,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:47:59,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:47:59,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:00,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:48:00,407 INFO L356 Elim1Store]: treesize reduction 116, result has 13.4 percent of original size [2022-07-21 17:48:00,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 157 treesize of output 86 [2022-07-21 17:48:00,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:00,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2022-07-21 17:48:00,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:00,629 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 17:48:00,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 62 [2022-07-21 17:48:00,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:00,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:00,644 INFO L356 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-07-21 17:48:00,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 59 [2022-07-21 17:48:00,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 3 [2022-07-21 17:48:00,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:00,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 28 [2022-07-21 17:48:01,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:01,100 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:48:01,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 36 [2022-07-21 17:48:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:01,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:02,287 INFO L356 Elim1Store]: treesize reduction 199, result has 75.9 percent of original size [2022-07-21 17:48:02,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 283 treesize of output 642 [2022-07-21 17:48:03,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_39| Int) (v_ArrVal_3958 Int) (v_ArrVal_3970 (Array Int Int)) (v_ArrVal_3971 (Array Int Int)) (v_ArrVal_3963 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_39| v_ArrVal_3970)) (.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_39| v_ArrVal_3971))) (let ((.cse4 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select .cse9 .cse4) .cse3)) (.cse2 (select (select .cse7 .cse4) .cse3))) (let ((.cse6 (let ((.cse8 (store .cse9 .cse0 (store (select .cse9 .cse0) .cse2 v_ArrVal_3958)))) (store .cse8 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_39| (store (select .cse8 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_39|) 0 (select (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse6 .cse5) (select (select (store (store .cse7 .cse0 (store (select .cse7 .cse0) .cse2 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_39| v_ArrVal_3963) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= .cse0 .cse1) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_39|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_39| |c_#StackHeapBarrier|)) (and (= .cse2 .cse3) (= .cse4 .cse0)) (= .cse1 .cse5) (= .cse4 .cse1))))))))) is different from false [2022-07-21 17:48:03,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873835516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:03,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:03,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 71 [2022-07-21 17:48:03,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900410914] [2022-07-21 17:48:03,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:03,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-21 17:48:03,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:03,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-21 17:48:03,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=7130, Unknown=5, NotChecked=170, Total=7656 [2022-07-21 17:48:03,038 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 72 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 63 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:48:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:04,652 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2022-07-21 17:48:04,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-21 17:48:04,653 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 63 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-07-21 17:48:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:04,653 INFO L225 Difference]: With dead ends: 94 [2022-07-21 17:48:04,653 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:48:04,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2706 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=499, Invalid=9398, Unknown=7, NotChecked=196, Total=10100 [2022-07-21 17:48:04,654 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 43 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:04,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1298 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1558 Invalid, 0 Unknown, 21 Unchecked, 0.7s Time] [2022-07-21 17:48:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:48:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 17:48:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:48:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-07-21 17:48:04,657 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 62 [2022-07-21 17:48:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:04,658 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-07-21 17:48:04,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 63 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:48:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-07-21 17:48:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 17:48:04,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:04,659 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:04,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:04,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-21 17:48:04,883 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:48:04,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478904, now seen corresponding path program 1 times [2022-07-21 17:48:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:04,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921165773] [2022-07-21 17:48:04,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:04,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:05,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:06,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:06,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:48:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:48:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:06,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921165773] [2022-07-21 17:48:06,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921165773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:06,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441354762] [2022-07-21 17:48:06,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:06,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:06,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:06,852 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:48:06,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-21 17:48:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:07,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 190 conjunts are in the unsatisfiable core [2022-07-21 17:48:07,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:07,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:07,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:07,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:07,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:07,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:07,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:07,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:07,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-21 17:48:07,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:07,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:07,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:07,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:07,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:07,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:07,839 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:48:07,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-07-21 17:48:07,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:07,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:07,865 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:48:07,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-07-21 17:48:08,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:08,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:08,306 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:48:08,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 49 [2022-07-21 17:48:08,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:08,636 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:48:08,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 36 [2022-07-21 17:48:08,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:08,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:08,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 17:48:08,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:08,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:08,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:08,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:48:09,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:09,081 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:48:09,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 73 [2022-07-21 17:48:09,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:09,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:09,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:09,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:48:09,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:09,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:09,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:09,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:48:09,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:09,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:09,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:09,114 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 17:48:09,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-21 17:48:10,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:48:10,503 INFO L356 Elim1Store]: treesize reduction 116, result has 13.4 percent of original size [2022-07-21 17:48:10,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 177 treesize of output 98 [2022-07-21 17:48:10,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:10,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:10,513 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:48:10,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 72 [2022-07-21 17:48:10,810 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 17:48:10,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 236 treesize of output 159 [2022-07-21 17:48:10,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:10,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:10,836 INFO L356 Elim1Store]: treesize reduction 116, result has 22.7 percent of original size [2022-07-21 17:48:10,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 182 treesize of output 129 [2022-07-21 17:48:11,679 INFO L356 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2022-07-21 17:48:11,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 95 [2022-07-21 17:48:11,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:11,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:11,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:11,691 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:48:11,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2022-07-21 17:48:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:11,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:19,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4183 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| Int) (v_ArrVal_4182 (Array Int Int)) (v_ArrVal_4171 (Array Int Int)) (v_ArrVal_4184 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| v_ArrVal_4184)) (.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| v_ArrVal_4182))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select .cse13 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse5 (select (select .cse11 .cse6) .cse4)) (.cse3 (select (select .cse13 .cse6) .cse4))) (let ((.cse10 (let ((.cse12 (store .cse13 .cse5 (store (select .cse13 .cse5) .cse3 0)))) (store .cse12 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| (store (select .cse12 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42|) 0 (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse9 (store (store .cse11 .cse5 (store (select .cse11 .cse5) .cse3 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| v_ArrVal_4171))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| v_ArrVal_4183)) (.cse0 (select (select .cse10 .cse8) .cse7)) (.cse2 (select (select .cse9 .cse8) .cse7))) (or (and (<= (+ 8 .cse0) (select .cse1 .cse2)) (<= 0 (+ 4 .cse0))) (and (= .cse3 .cse4) (= .cse5 .cse6)) (not (<= (+ .cse3 4) (select .cse1 .cse5))) (not (<= 0 .cse7)) (not (<= 0 .cse3)) (and (= .cse7 .cse0) (= .cse2 .cse8)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| |c_#StackHeapBarrier|)))))))))) is different from false [2022-07-21 17:48:19,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441354762] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:19,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:19,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2022-07-21 17:48:19,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642192144] [2022-07-21 17:48:19,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:19,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-21 17:48:19,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:19,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-21 17:48:19,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=8427, Unknown=7, NotChecked=186, Total=9120 [2022-07-21 17:48:19,212 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 76 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:48:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:22,623 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-07-21 17:48:22,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-21 17:48:22,624 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-07-21 17:48:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:22,624 INFO L225 Difference]: With dead ends: 94 [2022-07-21 17:48:22,624 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:48:22,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3351 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=878, Invalid=12454, Unknown=12, NotChecked=228, Total=13572 [2022-07-21 17:48:22,625 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 77 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:22,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1217 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1740 Invalid, 0 Unknown, 163 Unchecked, 1.0s Time] [2022-07-21 17:48:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:48:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 17:48:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:48:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-21 17:48:22,628 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 62 [2022-07-21 17:48:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:22,629 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-21 17:48:22,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:48:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-21 17:48:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 17:48:22,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:22,630 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:22,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-21 17:48:22,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:22,851 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:48:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1350141375, now seen corresponding path program 1 times [2022-07-21 17:48:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:22,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50809156] [2022-07-21 17:48:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:23,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:48:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:48:24,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:24,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50809156] [2022-07-21 17:48:24,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50809156] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:24,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940767001] [2022-07-21 17:48:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:24,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:24,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:24,018 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:48:24,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-21 17:48:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-21 17:48:24,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:24,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:24,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:24,446 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:48:24,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:48:24,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:24,669 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:48:24,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:48:24,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:24,940 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:48:24,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-21 17:48:25,131 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:48:25,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 21 [2022-07-21 17:48:25,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:48:25,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:25,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:25,439 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-21 17:48:25,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 37 [2022-07-21 17:48:25,446 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:48:25,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:25,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:25,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-07-21 17:48:25,993 INFO L356 Elim1Store]: treesize reduction 107, result has 17.1 percent of original size [2022-07-21 17:48:25,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 53 [2022-07-21 17:48:26,001 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:48:26,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 78 [2022-07-21 17:48:26,122 INFO L356 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-07-21 17:48:26,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 89 [2022-07-21 17:48:26,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:26,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 81 [2022-07-21 17:48:26,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 29 [2022-07-21 17:48:26,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 115 treesize of output 87 [2022-07-21 17:48:26,690 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-07-21 17:48:26,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 41 [2022-07-21 17:48:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:26,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:26,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4375))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4376) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-07-21 17:48:26,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4373 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4375))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4373) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4376) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-21 17:48:26,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4373 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4375))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_4373) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4376) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-21 17:48:26,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4373 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_35| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_35| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4375))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4373) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4376) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-21 17:48:26,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4373 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_35| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_35| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4375))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4373) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4376) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-21 17:48:26,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4373 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_35| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_35| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4375))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4373) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4376) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-07-21 17:48:26,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4373 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_35| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_35| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4375))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4373) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4376) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-07-21 17:48:26,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4384 (Array Int Int)) (v_ArrVal_4373 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| Int) (v_ArrVal_4376 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| |c_#StackHeapBarrier|)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4384)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4383))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_35| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4375))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store .cse2 .cse3 v_ArrVal_4373) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4376) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) is different from false [2022-07-21 17:48:26,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940767001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:26,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:26,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 65 [2022-07-21 17:48:26,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151024778] [2022-07-21 17:48:26,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:26,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-21 17:48:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:26,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-21 17:48:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3968, Unknown=8, NotChecked=1064, Total=5256 [2022-07-21 17:48:26,830 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 65 states, 61 states have (on average 1.7540983606557377) internal successors, (107), 56 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:48:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:28,572 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-07-21 17:48:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-21 17:48:28,572 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 1.7540983606557377) internal successors, (107), 56 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-07-21 17:48:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:28,573 INFO L225 Difference]: With dead ends: 94 [2022-07-21 17:48:28,573 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:48:28,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=454, Invalid=6050, Unknown=8, NotChecked=1320, Total=7832 [2022-07-21 17:48:28,574 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:28,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1325 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1056 Invalid, 0 Unknown, 111 Unchecked, 0.5s Time] [2022-07-21 17:48:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:48:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 17:48:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:48:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-21 17:48:28,577 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 63 [2022-07-21 17:48:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:28,577 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-21 17:48:28,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 1.7540983606557377) internal successors, (107), 56 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:48:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-21 17:48:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 17:48:28,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:28,578 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:28,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:28,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-21 17:48:28,784 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:48:28,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1095322985, now seen corresponding path program 1 times [2022-07-21 17:48:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:28,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279791206] [2022-07-21 17:48:28,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:29,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:48:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:48:30,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:30,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279791206] [2022-07-21 17:48:30,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279791206] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:30,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433278361] [2022-07-21 17:48:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:30,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:30,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:30,083 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:48:30,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-21 17:48:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:30,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 165 conjunts are in the unsatisfiable core [2022-07-21 17:48:30,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:30,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:30,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:30,537 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:48:30,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:48:30,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:30,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:30,782 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:48:30,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-07-21 17:48:30,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:30,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:31,090 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:48:31,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 36 [2022-07-21 17:48:31,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:31,318 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:48:31,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 27 [2022-07-21 17:48:31,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:31,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:31,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:48:31,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:31,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:31,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:31,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:48:31,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:31,679 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:48:31,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 58 [2022-07-21 17:48:31,687 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:48:31,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:32,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:48:32,954 INFO L356 Elim1Store]: treesize reduction 116, result has 13.4 percent of original size [2022-07-21 17:48:32,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 186 treesize of output 107 [2022-07-21 17:48:32,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:32,962 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:48:32,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 60 [2022-07-21 17:48:33,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:33,185 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:48:33,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 88 [2022-07-21 17:48:33,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:33,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:33,199 INFO L356 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2022-07-21 17:48:33,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 67 [2022-07-21 17:48:33,349 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:48:33,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 99 treesize of output 54 [2022-07-21 17:48:33,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:33,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:33,874 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-21 17:48:33,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 25 [2022-07-21 17:48:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:33,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:33,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 6 [2022-07-21 17:48:45,745 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4581 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_4578 Int) (v_ArrVal_4588 (Array Int Int)) (v_ArrVal_4589 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4588)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4589))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select .cse1 .cse5) .cse6))) (let ((.cse7 (select .cse9 .cse2)) (.cse3 (select (select .cse9 .cse5) .cse6))) (let ((.cse0 (let ((.cse8 (store .cse9 .cse2 (store .cse7 .cse3 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (store .cse8 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| (store (select .cse8 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| |c_#StackHeapBarrier|)) (<= 0 (select (select .cse0 (select (select (store (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_4578)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48|) 0)) (and (= .cse5 .cse2) (= .cse6 .cse3)) (not (= .cse6 (select .cse7 .cse3))) (not (<= 0 .cse4)) (not (<= 0 .cse3)))))))))) is different from false [2022-07-21 17:48:45,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433278361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:45,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:45,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 40] total 72 [2022-07-21 17:48:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552146645] [2022-07-21 17:48:45,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:45,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-21 17:48:45,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:45,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-21 17:48:45,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=8099, Unknown=10, NotChecked=182, Total=8742 [2022-07-21 17:48:45,750 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 73 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 64 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:48:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:48,306 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-07-21 17:48:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-21 17:48:48,306 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 64 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-07-21 17:48:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:48,307 INFO L225 Difference]: With dead ends: 98 [2022-07-21 17:48:48,307 INFO L226 Difference]: Without dead ends: 98 [2022-07-21 17:48:48,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2853 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=641, Invalid=10907, Unknown=12, NotChecked=212, Total=11772 [2022-07-21 17:48:48,308 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:48,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1464 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1474 Invalid, 0 Unknown, 153 Unchecked, 1.1s Time] [2022-07-21 17:48:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-21 17:48:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-07-21 17:48:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.25) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:48:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-07-21 17:48:48,311 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 64 [2022-07-21 17:48:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:48,312 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-07-21 17:48:48,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 64 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:48:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-07-21 17:48:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 17:48:48,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:48,313 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:48,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:48,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:48,527 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:48:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1095322986, now seen corresponding path program 1 times [2022-07-21 17:48:48,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:48,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193428298] [2022-07-21 17:48:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:48,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:49,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:50,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:48:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:48:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193428298] [2022-07-21 17:48:51,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193428298] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408262061] [2022-07-21 17:48:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:51,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:51,360 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:48:51,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-21 17:48:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:51,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 190 conjunts are in the unsatisfiable core [2022-07-21 17:48:51,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:51,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:51,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:51,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:52,035 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:48:52,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:48:52,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:52,678 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:48:52,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:48:52,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:48:52,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:48:52,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:52,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:48:53,216 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:48:53,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2022-07-21 17:48:53,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:48:53,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-21 17:48:53,612 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:48:53,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 40 [2022-07-21 17:48:53,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:48:54,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:54,176 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:48:54,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 67 [2022-07-21 17:48:54,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:54,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 17:48:54,201 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 17:48:54,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 17:48:54,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:54,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:54,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:48:55,818 INFO L356 Elim1Store]: treesize reduction 143, result has 15.4 percent of original size [2022-07-21 17:48:55,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 222 treesize of output 108 [2022-07-21 17:48:55,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:55,840 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-21 17:48:55,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 99 [2022-07-21 17:48:55,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:48:55,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:55,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2022-07-21 17:48:56,047 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 17:48:56,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 238 treesize of output 157 [2022-07-21 17:48:56,081 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-07-21 17:48:56,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 154 [2022-07-21 17:48:56,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 52 [2022-07-21 17:48:56,638 INFO L356 Elim1Store]: treesize reduction 44, result has 26.7 percent of original size [2022-07-21 17:48:56,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 74 [2022-07-21 17:48:56,948 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:48:56,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-21 17:48:57,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:48:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:48:57,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:57,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4794 (Array Int Int)) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4795)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4794))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4796) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2022-07-21 17:48:57,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4791 (Array Int Int)) (v_ArrVal_4794 (Array Int Int)) (v_ArrVal_4789 Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4791) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4795)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4794))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_4789)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4796) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2022-07-21 17:48:59,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4806 (Array Int Int)) (v_ArrVal_4807 (Array Int Int)) (v_ArrVal_4791 (Array Int Int)) (v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4794 (Array Int Int)) (v_ArrVal_4789 Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4806)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4807))) (let ((.cse10 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse11 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse7 .cse10) .cse11))) (let ((.cse8 (select .cse7 .cse1)) (.cse2 (select (select .cse9 .cse10) .cse11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store .cse9 .cse1 v_ArrVal_4791) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4795)) (.cse3 (store (store .cse7 .cse1 (store .cse8 .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4794))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4808))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4789))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4796) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)) (not (= .cse10 (select .cse8 .cse2))))))))) is different from false [2022-07-21 17:48:59,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408262061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:59,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:59,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 41] total 75 [2022-07-21 17:48:59,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009771755] [2022-07-21 17:48:59,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:59,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-21 17:48:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:59,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-21 17:48:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=7318, Unknown=9, NotChecked=522, Total=8190 [2022-07-21 17:48:59,749 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 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) [2022-07-21 17:49:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:05,227 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-07-21 17:49:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-21 17:49:05,227 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 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 64 [2022-07-21 17:49:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:05,228 INFO L225 Difference]: With dead ends: 97 [2022-07-21 17:49:05,228 INFO L226 Difference]: Without dead ends: 97 [2022-07-21 17:49:05,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 114 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2639 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=685, Invalid=11974, Unknown=9, NotChecked=672, Total=13340 [2022-07-21 17:49:05,230 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 83 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:05,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1448 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1950 Invalid, 0 Unknown, 216 Unchecked, 1.5s Time] [2022-07-21 17:49:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-21 17:49:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-07-21 17:49:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.236842105263158) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:49:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-07-21 17:49:05,233 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 64 [2022-07-21 17:49:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:05,233 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-07-21 17:49:05,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 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) [2022-07-21 17:49:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-07-21 17:49:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 17:49:05,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:05,234 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:49:05,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-21 17:49:05,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:49:05,448 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:49:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826698, now seen corresponding path program 2 times [2022-07-21 17:49:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:49:05,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782983592] [2022-07-21 17:49:05,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:05,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:49:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:07,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:49:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:07,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:49:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:07,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:49:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:49:08,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:49:08,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782983592] [2022-07-21 17:49:08,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782983592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:49:08,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934123210] [2022-07-21 17:49:08,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:49:08,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:49:08,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:49:08,442 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:49:08,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-21 17:49:08,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:49:08,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:49:08,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 147 conjunts are in the unsatisfiable core [2022-07-21 17:49:08,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:08,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:09,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:09,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:09,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:09,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:09,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:09,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-21 17:49:10,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:10,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:10,014 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:49:10,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:11,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:11,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:12,024 INFO L356 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-07-21 17:49:12,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 177 treesize of output 116 [2022-07-21 17:49:12,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:12,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:12,059 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-21 17:49:12,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 87 [2022-07-21 17:49:12,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:12,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:12,688 INFO L356 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2022-07-21 17:49:12,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 289 treesize of output 166 [2022-07-21 17:49:12,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:12,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:12,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:12,732 INFO L356 Elim1Store]: treesize reduction 112, result has 30.9 percent of original size [2022-07-21 17:49:12,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 240 treesize of output 127 [2022-07-21 17:49:20,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:20,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:20,786 INFO L356 Elim1Store]: treesize reduction 105, result has 13.2 percent of original size [2022-07-21 17:49:20,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 355 treesize of output 217 [2022-07-21 17:49:25,723 INFO L356 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2022-07-21 17:49:25,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 144 [2022-07-21 17:49:32,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:32,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:32,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:32,904 INFO L356 Elim1Store]: treesize reduction 149, result has 24.4 percent of original size [2022-07-21 17:49:32,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 25 case distinctions, treesize of input 208 treesize of output 135 [2022-07-21 17:49:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:49:33,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:35,737 INFO L356 Elim1Store]: treesize reduction 18, result has 98.3 percent of original size [2022-07-21 17:49:35,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 550 treesize of output 1082 [2022-07-21 17:49:37,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3727 treesize of output 2984 [2022-07-21 17:49:39,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934123210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:49:39,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:49:39,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 35] total 76 [2022-07-21 17:49:39,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306980060] [2022-07-21 17:49:39,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:49:39,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-07-21 17:49:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:49:39,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-07-21 17:49:39,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=8700, Unknown=1, NotChecked=0, Total=9120 [2022-07-21 17:49:39,150 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 77 states, 73 states have (on average 1.643835616438356) internal successors, (120), 70 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:49:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:45,606 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-21 17:49:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-21 17:49:45,606 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 73 states have (on average 1.643835616438356) internal successors, (120), 70 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 68 [2022-07-21 17:49:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:45,607 INFO L225 Difference]: With dead ends: 100 [2022-07-21 17:49:45,607 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 17:49:45,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=831, Invalid=14667, Unknown=2, NotChecked=0, Total=15500 [2022-07-21 17:49:45,608 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:45,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1656 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1940 Invalid, 0 Unknown, 359 Unchecked, 1.4s Time] [2022-07-21 17:49:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 17:49:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-21 17:49:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.25) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:49:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-21 17:49:45,611 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 68 [2022-07-21 17:49:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:45,611 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-21 17:49:45,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 73 states have (on average 1.643835616438356) internal successors, (120), 70 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:49:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-21 17:49:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 17:49:45,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:45,613 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:49:45,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-21 17:49:45,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:49:45,837 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-07-21 17:49:45,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:45,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826697, now seen corresponding path program 2 times [2022-07-21 17:49:45,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:49:45,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989899018] [2022-07-21 17:49:45,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:45,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:49:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:49:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:48,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:49:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 17:49:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:49:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:49:49,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989899018] [2022-07-21 17:49:49,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989899018] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:49:49,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72391744] [2022-07-21 17:49:49,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:49:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:49:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:49:49,250 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:49:49,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-21 17:49:49,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:49:49,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:49:49,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 220 conjunts are in the unsatisfiable core [2022-07-21 17:49:49,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:49,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:49,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:49,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:49,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:50,050 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:49:50,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:49:50,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:50,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:50,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:49:50,298 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:49:50,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-21 17:49:50,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:50,561 INFO L356 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-07-21 17:49:50,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2022-07-21 17:49:50,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:50,588 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:49:50,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2022-07-21 17:49:50,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:49:50,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:49:51,177 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 17:49:51,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 43 [2022-07-21 17:49:51,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 22 [2022-07-21 17:49:51,633 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 17:49:51,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 46 [2022-07-21 17:49:51,646 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:49:51,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:49:51,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:51,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 17:49:51,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:51,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-21 17:49:52,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:52,284 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 17:49:52,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 92 [2022-07-21 17:49:52,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:52,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:52,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:52,310 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 17:49:52,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-21 17:49:52,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:52,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:52,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:52,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2022-07-21 17:49:52,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:52,330 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-21 17:49:52,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:49:54,440 INFO L356 Elim1Store]: treesize reduction 124, result has 19.5 percent of original size [2022-07-21 17:49:54,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 215 treesize of output 149 [2022-07-21 17:49:54,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:54,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:54,543 INFO L356 Elim1Store]: treesize reduction 148, result has 26.4 percent of original size [2022-07-21 17:49:54,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 94 treesize of output 92 [2022-07-21 17:49:56,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:56,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:56,413 INFO L356 Elim1Store]: treesize reduction 196, result has 15.5 percent of original size [2022-07-21 17:49:56,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 228 treesize of output 139 [2022-07-21 17:49:56,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:56,473 INFO L356 Elim1Store]: treesize reduction 104, result has 26.2 percent of original size [2022-07-21 17:49:56,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 175 treesize of output 121