./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:34:36,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:34:36,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:34:36,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:34:36,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:34:36,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:34:36,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:34:36,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:34:36,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:34:36,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:34:36,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:34:36,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:34:36,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:34:36,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:34:36,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:34:36,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:34:36,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:34:36,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:34:36,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:34:36,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:34:36,431 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:34:36,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:34:36,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:34:36,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:34:36,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:34:36,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:34:36,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:34:36,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:34:36,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:34:36,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:34:36,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:34:36,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:34:36,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:34:36,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:34:36,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:34:36,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:34:36,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:34:36,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:34:36,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:34:36,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:34:36,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:34:36,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:34:36,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:34:36,477 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:34:36,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:34:36,483 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:34:36,484 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:34:36,484 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:34:36,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:34:36,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:34:36,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:34:36,486 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:34:36,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:34:36,486 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:34:36,487 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:34:36,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:34:36,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:34:36,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:34:36,487 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:34:36,487 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:34:36,487 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:34:36,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:34:36,488 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:34:36,488 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:34:36,488 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:34:36,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:34:36,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:34:36,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:34:36,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:34:36,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:34:36,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:34:36,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:34:36,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:34:36,490 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2022-07-23 06:34:36,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:34:36,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:34:36,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:34:36,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:34:36,701 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:34:36,702 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-07-23 06:34:36,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d068051d/e7230e03633b4c98aaf21f51439c3923/FLAGb237e198a [2022-07-23 06:34:37,116 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:34:37,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-07-23 06:34:37,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d068051d/e7230e03633b4c98aaf21f51439c3923/FLAGb237e198a [2022-07-23 06:34:37,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d068051d/e7230e03633b4c98aaf21f51439c3923 [2022-07-23 06:34:37,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:34:37,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:34:37,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:34:37,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:34:37,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:34:37,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db6f6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37, skipping insertion in model container [2022-07-23 06:34:37,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:34:37,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:34:37,817 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_prepend_unequal.i[24547,24560] [2022-07-23 06:34:37,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:34:37,832 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:34:37,870 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_prepend_unequal.i[24547,24560] [2022-07-23 06:34:37,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:34:37,896 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:34:37,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37 WrapperNode [2022-07-23 06:34:37,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:34:37,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:34:37,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:34:37,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:34:37,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,938 INFO L137 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-07-23 06:34:37,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:34:37,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:34:37,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:34:37,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:34:37,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:34:37,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:34:37,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:34:37,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:34:37,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (1/1) ... [2022-07-23 06:34:37,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:34:38,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:34:38,017 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-23 06:34:38,022 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-23 06:34:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:34:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:34:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-23 06:34:38,047 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-23 06:34:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:34:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:34:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:34:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:34:38,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:34:38,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:34:38,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 06:34:38,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:34:38,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:34:38,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:34:38,134 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:34:38,136 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:34:38,396 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:34:38,402 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:34:38,402 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-23 06:34:38,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:34:38 BoogieIcfgContainer [2022-07-23 06:34:38,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:34:38,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:34:38,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:34:38,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:34:38,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:34:37" (1/3) ... [2022-07-23 06:34:38,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed0668a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:34:38, skipping insertion in model container [2022-07-23 06:34:38,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:34:37" (2/3) ... [2022-07-23 06:34:38,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed0668a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:34:38, skipping insertion in model container [2022-07-23 06:34:38,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:34:38" (3/3) ... [2022-07-23 06:34:38,412 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2022-07-23 06:34:38,429 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:34:38,429 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-07-23 06:34:38,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:34:38,487 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@1f923330, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b4612eb [2022-07-23 06:34:38,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-07-23 06:34:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 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-23 06:34:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:34:38,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:38,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:34:38,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:38,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:38,514 INFO L85 PathProgramCache]: Analyzing trace with hash 895521621, now seen corresponding path program 1 times [2022-07-23 06:34:38,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:38,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171309342] [2022-07-23 06:34:38,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:38,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:38,659 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-23 06:34:38,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171309342] [2022-07-23 06:34:38,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171309342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:34:38,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:34:38,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:34:38,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828498457] [2022-07-23 06:34:38,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:34:38,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:34:38,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:34:38,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:34:38,696 INFO L87 Difference]: Start difference. First operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 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-23 06:34:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:38,802 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-07-23 06:34:38,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:34:38,804 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-23 06:34:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:38,809 INFO L225 Difference]: With dead ends: 125 [2022-07-23 06:34:38,809 INFO L226 Difference]: Without dead ends: 122 [2022-07-23 06:34:38,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:34:38,819 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:38,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 197 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:34:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-23 06:34:38,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-23 06:34:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.953125) internal successors, (125), 117 states have internal predecessors, (125), 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-23 06:34:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2022-07-23 06:34:38,848 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 6 [2022-07-23 06:34:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:38,848 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2022-07-23 06:34:38,848 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-23 06:34:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2022-07-23 06:34:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:34:38,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:38,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:34:38,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:34:38,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:38,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash 895521622, now seen corresponding path program 1 times [2022-07-23 06:34:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:38,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339612474] [2022-07-23 06:34:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:38,914 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-23 06:34:38,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:38,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339612474] [2022-07-23 06:34:38,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339612474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:34:38,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:34:38,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:34:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099863026] [2022-07-23 06:34:38,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:34:38,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:34:38,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:38,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:34:38,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:34:38,919 INFO L87 Difference]: Start difference. First operand 122 states and 131 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-23 06:34:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:39,021 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2022-07-23 06:34:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:34:39,022 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-23 06:34:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:39,023 INFO L225 Difference]: With dead ends: 120 [2022-07-23 06:34:39,023 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 06:34:39,023 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-23 06:34:39,024 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:39,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:34:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 06:34:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-23 06:34:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.921875) internal successors, (123), 115 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:34:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-07-23 06:34:39,032 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 6 [2022-07-23 06:34:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:39,033 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-07-23 06:34:39,033 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-23 06:34:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-07-23 06:34:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 06:34:39,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:39,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:34:39,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:34:39,034 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash 164994135, now seen corresponding path program 1 times [2022-07-23 06:34:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:39,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228829599] [2022-07-23 06:34:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:39,133 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-23 06:34:39,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:39,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228829599] [2022-07-23 06:34:39,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228829599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:34:39,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:34:39,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:34:39,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078385651] [2022-07-23 06:34:39,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:34:39,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:34:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:39,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:34:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:34:39,143 INFO L87 Difference]: Start difference. First operand 120 states and 129 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-23 06:34:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:39,254 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-07-23 06:34:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:34:39,256 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-23 06:34:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:39,261 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:34:39,262 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:34:39,263 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-23 06:34:39,267 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 5 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:39,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:34:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:34:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2022-07-23 06:34:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 116 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-23 06:34:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2022-07-23 06:34:39,278 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 13 [2022-07-23 06:34:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:39,279 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2022-07-23 06:34:39,279 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-23 06:34:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2022-07-23 06:34:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:34:39,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:39,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:34:39,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:34:39,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453220, now seen corresponding path program 1 times [2022-07-23 06:34:39,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:39,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991984192] [2022-07-23 06:34:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:39,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:39,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:39,403 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-23 06:34:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991984192] [2022-07-23 06:34:39,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991984192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:34:39,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:34:39,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:34:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747583064] [2022-07-23 06:34:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:34:39,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:34:39,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:34:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:34:39,405 INFO L87 Difference]: Start difference. First operand 121 states and 130 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-23 06:34:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:39,610 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-07-23 06:34:39,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:34:39,611 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-23 06:34:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:39,613 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:34:39,613 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:34:39,614 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-23 06:34:39,622 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 13 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:39,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 419 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:34:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:34:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2022-07-23 06:34:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 115 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:34:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-07-23 06:34:39,628 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 22 [2022-07-23 06:34:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:39,629 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-07-23 06:34:39,629 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-23 06:34:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-07-23 06:34:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:34:39,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:39,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:34:39,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:34:39,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453219, now seen corresponding path program 1 times [2022-07-23 06:34:39,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:39,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165015969] [2022-07-23 06:34:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:39,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:39,727 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-23 06:34:39,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:39,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165015969] [2022-07-23 06:34:39,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165015969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:34:39,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:34:39,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:34:39,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446925226] [2022-07-23 06:34:39,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:34:39,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:34:39,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:39,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:34:39,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:34:39,730 INFO L87 Difference]: Start difference. First operand 120 states and 129 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-23 06:34:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:39,896 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-07-23 06:34:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:34:39,896 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-23 06:34:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:39,897 INFO L225 Difference]: With dead ends: 120 [2022-07-23 06:34:39,898 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 06:34:39,898 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-23 06:34:39,899 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 11 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:39,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 443 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:34:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 06:34:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-07-23 06:34:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.876923076923077) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:34:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2022-07-23 06:34:39,915 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 22 [2022-07-23 06:34:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:39,916 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2022-07-23 06:34:39,916 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-23 06:34:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2022-07-23 06:34:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:34:39,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:39,917 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-23 06:34:39,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:34:39,918 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296005, now seen corresponding path program 1 times [2022-07-23 06:34:39,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:39,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534274743] [2022-07-23 06:34:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:40,068 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-23 06:34:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:40,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534274743] [2022-07-23 06:34:40,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534274743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:40,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598628057] [2022-07-23 06:34:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:40,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:34:40,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:34:40,071 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-23 06:34:40,087 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-23 06:34:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:40,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 06:34:40,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:34:40,219 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-23 06:34:40,319 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:34:40,328 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-23 06:34:40,389 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-23 06:34:40,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:34:40,661 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-23 06:34:40,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598628057] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:34:40,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:34:40,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-07-23 06:34:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161730326] [2022-07-23 06:34:40,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:34:40,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 06:34:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:40,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 06:34:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:34:40,664 INFO L87 Difference]: Start difference. First operand 119 states and 128 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-23 06:34:40,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:40,878 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-07-23 06:34:40,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:34:40,878 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-23 06:34:40,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:40,879 INFO L225 Difference]: With dead ends: 125 [2022-07-23 06:34:40,879 INFO L226 Difference]: Without dead ends: 125 [2022-07-23 06:34:40,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:34:40,880 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 32 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:40,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 728 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 411 Invalid, 0 Unknown, 132 Unchecked, 0.2s Time] [2022-07-23 06:34:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-23 06:34:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-23 06:34:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.7887323943661972) internal successors, (127), 119 states have internal predecessors, (127), 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-23 06:34:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-07-23 06:34:40,887 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 25 [2022-07-23 06:34:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:40,887 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-07-23 06:34:40,888 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-23 06:34:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-07-23 06:34:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:34:40,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:40,889 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-23 06:34:40,923 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-23 06:34:41,090 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-23 06:34:41,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296006, now seen corresponding path program 1 times [2022-07-23 06:34:41,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:41,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441288479] [2022-07-23 06:34:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:41,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:41,239 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-23 06:34:41,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:41,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441288479] [2022-07-23 06:34:41,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441288479] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:41,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105314392] [2022-07-23 06:34:41,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:41,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:34:41,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:34:41,241 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-23 06:34:41,242 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-23 06:34:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:41,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 06:34:41,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:34:41,331 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-23 06:34:41,505 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:34:41,506 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-23 06:34:41,511 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-23 06:34:41,554 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-23 06:34:41,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:34:43,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105314392] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:43,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:34:43,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-07-23 06:34:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403945154] [2022-07-23 06:34:43,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:34:43,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:34:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:34:43,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:34:43,677 INFO L87 Difference]: Start difference. First operand 125 states and 133 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-23 06:34:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:44,141 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-07-23 06:34:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:34:44,142 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-23 06:34:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:44,143 INFO L225 Difference]: With dead ends: 126 [2022-07-23 06:34:44,143 INFO L226 Difference]: Without dead ends: 126 [2022-07-23 06:34:44,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-07-23 06:34:44,143 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 126 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:44,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 706 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:34:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-23 06:34:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-07-23 06:34:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 118 states have internal predecessors, (126), 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-23 06:34:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-07-23 06:34:44,147 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 25 [2022-07-23 06:34:44,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:44,147 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-07-23 06:34:44,148 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-23 06:34:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-07-23 06:34:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:34:44,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:44,148 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-23 06:34:44,173 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-23 06:34:44,363 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-23 06:34:44,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704927, now seen corresponding path program 1 times [2022-07-23 06:34:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:44,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710976770] [2022-07-23 06:34:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:44,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:34:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:44,520 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-23 06:34:44,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:44,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710976770] [2022-07-23 06:34:44,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710976770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:44,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637738792] [2022-07-23 06:34:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:44,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:34:44,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:34:44,522 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-23 06:34:44,523 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-23 06:34:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:44,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-23 06:34:44,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:34:44,628 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-23 06:34:44,635 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-23 06:34:44,772 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:34:44,772 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-23 06:34:44,841 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:34:44,841 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-23 06:34:44,848 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-23 06:34:44,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:34:45,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637738792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:45,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:34:45,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2022-07-23 06:34:45,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601783582] [2022-07-23 06:34:45,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:34:45,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 06:34:45,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:45,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 06:34:45,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:34:45,102 INFO L87 Difference]: Start difference. First operand 124 states and 132 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-23 06:34:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:45,351 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2022-07-23 06:34:45,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 06:34:45,353 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-23 06:34:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:45,353 INFO L225 Difference]: With dead ends: 138 [2022-07-23 06:34:45,353 INFO L226 Difference]: Without dead ends: 138 [2022-07-23 06:34:45,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-07-23 06:34:45,354 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 263 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:45,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 452 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 308 Invalid, 0 Unknown, 196 Unchecked, 0.2s Time] [2022-07-23 06:34:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-23 06:34:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2022-07-23 06:34:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 110 states have internal predecessors, (118), 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-23 06:34:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2022-07-23 06:34:45,358 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 37 [2022-07-23 06:34:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:45,358 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2022-07-23 06:34:45,358 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-23 06:34:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2022-07-23 06:34:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:34:45,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:45,359 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-23 06:34:45,384 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-23 06:34:45,563 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-23 06:34:45,563 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:45,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:45,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704928, now seen corresponding path program 1 times [2022-07-23 06:34:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:45,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996355740] [2022-07-23 06:34:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:45,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:45,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:34:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:45,749 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-23 06:34:45,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:45,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996355740] [2022-07-23 06:34:45,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996355740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:34:45,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:34:45,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:34:45,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459137538] [2022-07-23 06:34:45,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:34:45,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:34:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:45,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:34:45,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:34:45,750 INFO L87 Difference]: Start difference. First operand 116 states and 124 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-23 06:34:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:45,903 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-07-23 06:34:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:34:45,903 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-23 06:34:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:45,904 INFO L225 Difference]: With dead ends: 125 [2022-07-23 06:34:45,904 INFO L226 Difference]: Without dead ends: 125 [2022-07-23 06:34:45,904 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-23 06:34:45,905 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 353 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:45,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 126 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:34:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-23 06:34:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-07-23 06:34:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 101 states have internal predecessors, (109), 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-23 06:34:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-07-23 06:34:45,908 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 37 [2022-07-23 06:34:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:45,908 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-07-23 06:34:45,908 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-23 06:34:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-07-23 06:34:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:34:45,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:45,909 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] [2022-07-23 06:34:45,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 06:34:45,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990998, now seen corresponding path program 1 times [2022-07-23 06:34:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:45,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450977202] [2022-07-23 06:34:45,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:45,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:45,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:34:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:46,014 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-23 06:34:46,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:46,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450977202] [2022-07-23 06:34:46,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450977202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:34:46,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:34:46,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:34:46,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906325685] [2022-07-23 06:34:46,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:34:46,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:34:46,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:46,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:34:46,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:34:46,016 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-23 06:34:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:46,146 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-07-23 06:34:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:34:46,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 40 [2022-07-23 06:34:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:46,147 INFO L225 Difference]: With dead ends: 123 [2022-07-23 06:34:46,148 INFO L226 Difference]: Without dead ends: 123 [2022-07-23 06:34:46,148 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-23 06:34:46,148 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:46,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 289 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:34:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-23 06:34:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-07-23 06:34:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 99 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-23 06:34:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-07-23 06:34:46,151 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 40 [2022-07-23 06:34:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:46,154 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-07-23 06:34:46,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-23 06:34:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-07-23 06:34:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:34:46,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:46,157 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] [2022-07-23 06:34:46,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 06:34:46,158 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:46,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990997, now seen corresponding path program 1 times [2022-07-23 06:34:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:46,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636938651] [2022-07-23 06:34:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:46,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:46,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:46,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:34:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:46,262 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-23 06:34:46,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:46,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636938651] [2022-07-23 06:34:46,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636938651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:34:46,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:34:46,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:34:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532711938] [2022-07-23 06:34:46,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:34:46,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:34:46,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:46,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:34:46,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:34:46,265 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-23 06:34:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:46,386 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-07-23 06:34:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:34:46,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 40 [2022-07-23 06:34:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:46,388 INFO L225 Difference]: With dead ends: 103 [2022-07-23 06:34:46,388 INFO L226 Difference]: Without dead ends: 103 [2022-07-23 06:34:46,388 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-23 06:34:46,389 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 79 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:46,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 304 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:34:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-23 06:34:46,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-23 06:34:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 97 states have internal predecessors, (105), 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-23 06:34:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-07-23 06:34:46,391 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 40 [2022-07-23 06:34:46,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:46,391 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-07-23 06:34:46,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-23 06:34:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-07-23 06:34:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:34:46,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:46,392 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-23 06:34:46,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:34:46,392 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801691, now seen corresponding path program 1 times [2022-07-23 06:34:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:46,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291147900] [2022-07-23 06:34:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:46,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:46,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:46,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:46,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:34:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:46,630 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-23 06:34:46,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:46,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291147900] [2022-07-23 06:34:46,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291147900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:46,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231020334] [2022-07-23 06:34:46,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:46,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:34:46,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:34:46,632 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-23 06:34:46,633 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-23 06:34:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:46,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 06:34:46,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:34:46,884 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-23 06:34:47,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:47,014 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-23 06:34:47,023 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 06:34:47,023 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-23 06:34:47,084 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-23 06:34:47,094 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-23 06:34:47,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:34:47,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231020334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:34:47,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:34:47,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-07-23 06:34:47,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125245464] [2022-07-23 06:34:47,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:34:47,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:34:47,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:47,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:34:47,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=622, Unknown=2, NotChecked=0, Total=702 [2022-07-23 06:34:47,097 INFO L87 Difference]: Start difference. First operand 103 states and 111 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-23 06:34:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:47,375 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-07-23 06:34:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 06:34:47,376 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-23 06:34:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:47,377 INFO L225 Difference]: With dead ends: 154 [2022-07-23 06:34:47,377 INFO L226 Difference]: Without dead ends: 154 [2022-07-23 06:34:47,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=756, Unknown=2, NotChecked=0, Total=870 [2022-07-23 06:34:47,377 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 77 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:47,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 863 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 573 Invalid, 0 Unknown, 133 Unchecked, 0.2s Time] [2022-07-23 06:34:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-23 06:34:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 102. [2022-07-23 06:34:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 96 states have internal predecessors, (105), 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-23 06:34:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-07-23 06:34:47,380 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 41 [2022-07-23 06:34:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:47,380 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-07-23 06:34:47,380 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-23 06:34:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-07-23 06:34:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:34:47,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:47,381 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-23 06:34:47,398 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-23 06:34:47,591 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-23 06:34:47,591 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801690, now seen corresponding path program 1 times [2022-07-23 06:34:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:47,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154580983] [2022-07-23 06:34:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:34:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:47,956 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-23 06:34:47,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:47,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154580983] [2022-07-23 06:34:47,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154580983] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:47,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992146743] [2022-07-23 06:34:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:47,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:34:47,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:34:47,958 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-23 06:34:47,959 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-23 06:34:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:48,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-23 06:34:48,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:34:48,137 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-23 06:34:48,400 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-23 06:34:48,403 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-23 06:34:48,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:48,575 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-23 06:34:48,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:48,581 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-23 06:34:48,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:48,586 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-23 06:34:48,595 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 06:34:48,596 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-23 06:34:48,638 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-23 06:34:48,640 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-23 06:34:48,687 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-23 06:34:48,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:34:49,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992146743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:49,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:34:49,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2022-07-23 06:34:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668656048] [2022-07-23 06:34:49,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:34:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 06:34:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 06:34:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1221, Unknown=2, NotChecked=0, Total=1332 [2022-07-23 06:34:49,412 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 33 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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-23 06:34:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:50,678 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2022-07-23 06:34:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 06:34:50,679 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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-23 06:34:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:50,680 INFO L225 Difference]: With dead ends: 164 [2022-07-23 06:34:50,680 INFO L226 Difference]: Without dead ends: 164 [2022-07-23 06:34:50,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=229, Invalid=2215, Unknown=6, NotChecked=0, Total=2450 [2022-07-23 06:34:50,681 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 190 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:50,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2099 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1401 Invalid, 0 Unknown, 192 Unchecked, 0.7s Time] [2022-07-23 06:34:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-23 06:34:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 110. [2022-07-23 06:34:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.4125) internal successors, (113), 104 states have internal predecessors, (113), 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-23 06:34:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-07-23 06:34:50,684 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 41 [2022-07-23 06:34:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:50,685 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-07-23 06:34:50,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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-23 06:34:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-07-23 06:34:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:34:50,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:50,686 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-23 06:34:50,705 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-23 06:34:50,905 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-23 06:34:50,905 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:50,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2031121995, now seen corresponding path program 1 times [2022-07-23 06:34:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:50,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705331686] [2022-07-23 06:34:50,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:50,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:34:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:50,982 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-23 06:34:50,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:50,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705331686] [2022-07-23 06:34:50,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705331686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:34:50,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:34:50,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:34:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55262770] [2022-07-23 06:34:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:34:50,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:34:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:50,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:34:50,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:34:50,984 INFO L87 Difference]: Start difference. First operand 110 states and 119 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-23 06:34:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:51,048 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-07-23 06:34:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:34:51,048 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-23 06:34:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:51,049 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:34:51,049 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:34:51,050 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-23 06:34:51,050 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 160 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:51,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 160 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:34:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:34:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2022-07-23 06:34:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.4) internal successors, (112), 103 states have internal predecessors, (112), 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-23 06:34:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2022-07-23 06:34:51,055 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 42 [2022-07-23 06:34:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:51,055 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2022-07-23 06:34:51,055 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-23 06:34:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2022-07-23 06:34:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 06:34:51,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:51,056 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-23 06:34:51,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 06:34:51,057 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:51,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1993086700, now seen corresponding path program 1 times [2022-07-23 06:34:51,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:51,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779818976] [2022-07-23 06:34:51,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:51,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:34:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:51,414 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-23 06:34:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:51,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779818976] [2022-07-23 06:34:51,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779818976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:51,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968577900] [2022-07-23 06:34:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:51,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:34:51,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:34:51,415 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-23 06:34:51,416 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-23 06:34:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:51,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-23 06:34:51,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:34:51,782 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-23 06:34:51,829 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1453 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1453) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 06:34:51,834 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1454 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1454) |c_#memory_$Pointer$.base|)))) is different from true [2022-07-23 06:34:51,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:51,862 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-23 06:34:51,899 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-23 06:34:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-23 06:34:51,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:34:51,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (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_1458) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (<= 1 .cse0) (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_38| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 06:34:51,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968577900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:51,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:34:51,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2022-07-23 06:34:51,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219006816] [2022-07-23 06:34:51,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:34:51,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-23 06:34:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:51,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-23 06:34:51,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=961, Unknown=3, NotChecked=192, Total=1260 [2022-07-23 06:34:51,988 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 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-23 06:34:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:52,692 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2022-07-23 06:34:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:34:52,693 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 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 44 [2022-07-23 06:34:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:52,694 INFO L225 Difference]: With dead ends: 108 [2022-07-23 06:34:52,694 INFO L226 Difference]: Without dead ends: 108 [2022-07-23 06:34:52,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1629, Unknown=5, NotChecked=252, Total=2070 [2022-07-23 06:34:52,694 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 58 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:52,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1594 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 984 Invalid, 0 Unknown, 192 Unchecked, 0.4s Time] [2022-07-23 06:34:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-23 06:34:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2022-07-23 06:34:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 99 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-23 06:34:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-07-23 06:34:52,697 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 44 [2022-07-23 06:34:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:52,697 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-07-23 06:34:52,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 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-23 06:34:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-07-23 06:34:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:34:52,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:52,697 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-23 06:34:52,716 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-23 06:34:52,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-23 06:34:52,915 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176968, now seen corresponding path program 1 times [2022-07-23 06:34:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:52,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345674372] [2022-07-23 06:34:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:53,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:53,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:53,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:34:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:53,475 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-23 06:34:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:53,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345674372] [2022-07-23 06:34:53,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345674372] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:53,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257231182] [2022-07-23 06:34:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:53,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:34:53,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:34:53,477 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-23 06:34:53,478 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-23 06:34:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:53,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-23 06:34:53,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:34:53,676 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-23 06:34:53,850 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:34:53,851 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-23 06:34:53,927 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-23 06:34:54,035 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:34:54,035 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-23 06:34:54,170 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:34:54,171 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-23 06:34:54,175 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-23 06:34:54,282 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1621) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1622)))) is different from true [2022-07-23 06:34:54,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:54,327 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:34:54,327 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-23 06:34:54,351 INFO L356 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-07-23 06:34:54,351 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 36 treesize of output 52 [2022-07-23 06:34:54,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:54,356 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-23 06:34:54,420 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-23 06:34:54,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:34:54,590 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:34:54,590 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 50 treesize of output 28 [2022-07-23 06:34:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-23 06:34:54,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:34:54,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 Int) (|v_node_create_~temp~0#1.base_41| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_41| v_ArrVal_1632) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_41|) 0)) (not (<= 0 .cse0)) (not (< |v_node_create_~temp~0#1.base_41| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_41| v_ArrVal_1631) (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_41| v_ArrVal_1633))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) .cse0)) 1)))) is different from false [2022-07-23 06:34:54,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257231182] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:54,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:34:54,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 46 [2022-07-23 06:34:54,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245908887] [2022-07-23 06:34:54,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:34:54,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-23 06:34:54,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:54,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-23 06:34:54,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2193, Unknown=2, NotChecked=190, Total=2550 [2022-07-23 06:34:54,840 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 47 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 40 states have internal predecessors, (74), 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-23 06:34:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:34:55,816 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-07-23 06:34:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:34:55,817 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 40 states have internal predecessors, (74), 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-23 06:34:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:34:55,817 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:34:55,817 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:34:55,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=287, Invalid=3379, Unknown=2, NotChecked=238, Total=3906 [2022-07-23 06:34:55,819 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:34:55,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1417 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 889 Invalid, 0 Unknown, 329 Unchecked, 0.4s Time] [2022-07-23 06:34:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:34:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-07-23 06:34:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 117 states have internal predecessors, (128), 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-23 06:34:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2022-07-23 06:34:55,822 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 46 [2022-07-23 06:34:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:34:55,822 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2022-07-23 06:34:55,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 40 states have internal predecessors, (74), 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-23 06:34:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2022-07-23 06:34:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:34:55,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:34:55,822 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-23 06:34:55,845 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-23 06:34:56,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:34:56,035 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:34:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:34:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176969, now seen corresponding path program 1 times [2022-07-23 06:34:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:34:56,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704197472] [2022-07-23 06:34:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:34:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:56,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:34:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:56,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:34:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:34:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 06:34:57,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:34:57,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704197472] [2022-07-23 06:34:57,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704197472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:57,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908975331] [2022-07-23 06:34:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:34:57,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:34:57,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:34:57,084 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-23 06:34:57,085 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-23 06:34:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:34:57,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 114 conjunts are in the unsatisfiable core [2022-07-23 06:34:57,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:34:57,280 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-23 06:34:57,558 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:34:57,558 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-23 06:34:57,667 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-23 06:34:57,680 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-23 06:34:57,815 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:34:57,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, 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-23 06:34:57,821 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-23 06:34:58,034 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:34:58,034 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 79 treesize of output 38 [2022-07-23 06:34:58,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-07-23 06:34:58,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:58,314 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:34:58,314 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 85 treesize of output 75 [2022-07-23 06:34:58,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:58,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:58,322 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:34:58,322 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 1 case distinctions, treesize of input 83 treesize of output 80 [2022-07-23 06:34:58,334 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-23 06:34:58,334 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 32 treesize of output 34 [2022-07-23 06:34:58,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-23 06:34:58,571 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:34:58,571 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 83 treesize of output 42 [2022-07-23 06:34:58,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-07-23 06:34:58,648 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-23 06:34:58,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:34:59,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908975331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:34:59,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:34:59,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 55 [2022-07-23 06:34:59,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852855265] [2022-07-23 06:34:59,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:34:59,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-23 06:34:59,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:34:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-23 06:34:59,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3568, Unknown=8, NotChecked=0, Total=3782 [2022-07-23 06:34:59,948 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 56 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 49 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-23 06:35:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:02,109 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2022-07-23 06:35:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 06:35:02,109 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 49 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-23 06:35:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:02,110 INFO L225 Difference]: With dead ends: 184 [2022-07-23 06:35:02,110 INFO L226 Difference]: Without dead ends: 184 [2022-07-23 06:35:02,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=373, Invalid=5781, Unknown=8, NotChecked=0, Total=6162 [2022-07-23 06:35:02,112 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 97 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 456 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:35:02,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 2101 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1387 Invalid, 0 Unknown, 456 Unchecked, 0.7s Time] [2022-07-23 06:35:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-23 06:35:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 124. [2022-07-23 06:35:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 116 states have internal predecessors, (126), 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-23 06:35:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-07-23 06:35:02,115 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 46 [2022-07-23 06:35:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:02,115 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-07-23 06:35:02,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 49 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-23 06:35:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-07-23 06:35:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-23 06:35:02,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:02,116 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-23 06:35:02,136 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-23 06:35:02,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-23 06:35:02,336 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:35:02,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:02,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1589162821, now seen corresponding path program 2 times [2022-07-23 06:35:02,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:02,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115572590] [2022-07-23 06:35:02,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:02,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:02,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:02,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:35:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:03,073 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-23 06:35:03,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:03,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115572590] [2022-07-23 06:35:03,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115572590] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:03,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412703106] [2022-07-23 06:35:03,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:35:03,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:35:03,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:35:03,075 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-23 06:35:03,075 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-23 06:35:03,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:35:03,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:35:03,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-23 06:35:03,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:35:03,253 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-23 06:35:03,499 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:35:03,499 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-23 06:35:03,592 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-23 06:35:03,596 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-23 06:35:03,737 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 06:35:03,737 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-23 06:35:03,741 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-23 06:35:22,159 INFO L356 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-07-23 06:35:22,160 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-23 06:35:22,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:35:22,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:35:22,173 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 06:35:22,174 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 29 treesize of output 39 [2022-07-23 06:35:22,187 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-23 06:35:22,188 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-23 06:35:23,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:35:23,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:35:23,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:35:23,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:35:23,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:35:23,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:35:23,063 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:35:23,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 33 [2022-07-23 06:35:23,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:35:23,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:35:23,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:35:23,420 INFO L356 Elim1Store]: treesize reduction 142, result has 13.4 percent of original size [2022-07-23 06:35:23,421 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 11 new quantified variables, introduced 21 case distinctions, treesize of input 83 treesize of output 60 [2022-07-23 06:35:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:35:23,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:35:23,659 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-07-23 06:35:23,659 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-23 06:35:26,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412703106] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:26,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:35:26,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 62 [2022-07-23 06:35:26,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363709216] [2022-07-23 06:35:26,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:35:26,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-23 06:35:26,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-23 06:35:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4857, Unknown=9, NotChecked=0, Total=5112 [2022-07-23 06:35:26,333 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 63 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 56 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-23 06:35:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:42,385 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2022-07-23 06:35:42,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-23 06:35:42,391 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 56 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-23 06:35:42,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:42,392 INFO L225 Difference]: With dead ends: 151 [2022-07-23 06:35:42,392 INFO L226 Difference]: Without dead ends: 151 [2022-07-23 06:35:42,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=503, Invalid=8796, Unknown=13, NotChecked=0, Total=9312 [2022-07-23 06:35:42,394 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 87 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:35:42,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1558 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 968 Invalid, 0 Unknown, 343 Unchecked, 0.4s Time] [2022-07-23 06:35:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-23 06:35:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2022-07-23 06:35:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.3267326732673268) internal successors, (134), 122 states have internal predecessors, (134), 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-23 06:35:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2022-07-23 06:35:42,397 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 51 [2022-07-23 06:35:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:42,397 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2022-07-23 06:35:42,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 56 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-23 06:35:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2022-07-23 06:35:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-23 06:35:42,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:42,398 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-23 06:35:42,416 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-23 06:35:42,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 06:35:42,607 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:35:42,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1589162822, now seen corresponding path program 2 times [2022-07-23 06:35:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:42,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804158241] [2022-07-23 06:35:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:42,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:43,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:35:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:43,362 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-23 06:35:43,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:43,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804158241] [2022-07-23 06:35:43,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804158241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:43,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100367889] [2022-07-23 06:35:43,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:35:43,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:35:43,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:35:43,370 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-23 06:35:43,370 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-23 06:35:43,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:35:43,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:35:43,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 143 conjunts are in the unsatisfiable core [2022-07-23 06:35:43,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:35:43,561 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-23 06:35:43,834 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:35:43,835 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-23 06:35:43,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, 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-23 06:35:43,940 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-23 06:35:44,062 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 06:35:44,062 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 56 treesize of output 38 [2022-07-23 06:35:44,065 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-23 06:35:48,573 INFO L356 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-07-23 06:35:48,573 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 107 treesize of output 82 [2022-07-23 06:35:48,588 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-23 06:35:48,589 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-23 06:35:48,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:35:48,603 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-23 06:35:48,603 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 2 case distinctions, treesize of input 40 treesize of output 53 [2022-07-23 06:35:48,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:35:49,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:35:49,885 INFO L356 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2022-07-23 06:35:49,885 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 15 case distinctions, treesize of input 136 treesize of output 90 [2022-07-23 06:35:49,902 INFO L356 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2022-07-23 06:35:49,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 31 [2022-07-23 06:35:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:35:49,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:35:59,286 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:35:59,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100367889] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:59,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:35:59,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 59 [2022-07-23 06:35:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352377896] [2022-07-23 06:35:59,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:35:59,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-23 06:35:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:59,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-23 06:35:59,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=4594, Unknown=2, NotChecked=0, Total=4830 [2022-07-23 06:35:59,290 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand has 59 states, 55 states have (on average 1.6181818181818182) 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-23 06:36:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:09,836 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2022-07-23 06:36:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 06:36:09,837 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.6181818181818182) 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-23 06:36:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:09,837 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:36:09,837 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:36:09,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2436 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=489, Invalid=8435, Unknown=6, NotChecked=0, Total=8930 [2022-07-23 06:36:09,839 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 32 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:09,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1811 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 786 Invalid, 0 Unknown, 340 Unchecked, 0.4s Time] [2022-07-23 06:36:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:36:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-07-23 06:36:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.316326530612245) internal successors, (129), 119 states have internal predecessors, (129), 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-23 06:36:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-07-23 06:36:09,843 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 51 [2022-07-23 06:36:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:09,843 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-07-23 06:36:09,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.6181818181818182) 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-23 06:36:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-07-23 06:36:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 06:36:09,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:09,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:36:09,862 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-23 06:36:10,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:36:10,057 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:36:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:10,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680377, now seen corresponding path program 1 times [2022-07-23 06:36:10,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:36:10,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610636071] [2022-07-23 06:36:10,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:10,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:36:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:36:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:10,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:36:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:36:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:10,468 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-23 06:36:10,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:36:10,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610636071] [2022-07-23 06:36:10,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610636071] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:10,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056219656] [2022-07-23 06:36:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:10,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:36:10,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:36:10,470 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-23 06:36:10,471 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-23 06:36:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:10,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-23 06:36:10,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:10,692 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-23 06:36:10,840 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 11 treesize of output 7 [2022-07-23 06:36:10,876 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:36:10,877 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 25 treesize of output 20 [2022-07-23 06:36:10,926 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:36:10,926 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 28 treesize of output 12 [2022-07-23 06:36:10,929 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-23 06:36:10,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:10,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056219656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:10,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:36:10,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 29 [2022-07-23 06:36:10,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942023453] [2022-07-23 06:36:10,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:10,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:36:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:36:10,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:36:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2022-07-23 06:36:10,931 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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-23 06:36:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:11,136 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-07-23 06:36:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:36:11,136 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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 52 [2022-07-23 06:36:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:11,137 INFO L225 Difference]: With dead ends: 146 [2022-07-23 06:36:11,137 INFO L226 Difference]: Without dead ends: 146 [2022-07-23 06:36:11,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-07-23 06:36:11,138 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 203 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:11,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 378 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 299 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2022-07-23 06:36:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-23 06:36:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2022-07-23 06:36:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 118 states have internal predecessors, (128), 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-23 06:36:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-07-23 06:36:11,141 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 52 [2022-07-23 06:36:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:11,141 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-07-23 06:36:11,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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-23 06:36:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-07-23 06:36:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 06:36:11,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:11,142 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] [2022-07-23 06:36:11,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 06:36:11,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:36:11,355 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:36:11,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:11,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680376, now seen corresponding path program 1 times [2022-07-23 06:36:11,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:36:11,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685367253] [2022-07-23 06:36:11,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:11,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:36:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:11,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:36:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:11,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:36:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:11,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:36:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:11,893 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-23 06:36:11,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:36:11,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685367253] [2022-07-23 06:36:11,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685367253] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:11,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027443409] [2022-07-23 06:36:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:11,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:36:11,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:36:11,894 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-23 06:36:11,895 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-23 06:36:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:12,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-23 06:36:12,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:12,340 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 11 treesize of output 7 [2022-07-23 06:36:12,347 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 11 treesize of output 7 [2022-07-23 06:36:12,390 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:36:12,390 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 31 treesize of output 26 [2022-07-23 06:36:12,402 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:36:12,402 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 29 [2022-07-23 06:36:12,470 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 23 treesize of output 15 [2022-07-23 06:36:12,472 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-23 06:36:12,521 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-23 06:36:12,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:12,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027443409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:12,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:36:12,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [26] total 37 [2022-07-23 06:36:12,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698466642] [2022-07-23 06:36:12,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:12,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:36:12,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:36:12,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:36:12,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1232, Unknown=0, NotChecked=0, Total=1332 [2022-07-23 06:36:12,530 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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-23 06:36:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:12,745 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-23 06:36:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:36:12,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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 52 [2022-07-23 06:36:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:12,746 INFO L225 Difference]: With dead ends: 126 [2022-07-23 06:36:12,746 INFO L226 Difference]: Without dead ends: 126 [2022-07-23 06:36:12,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2022-07-23 06:36:12,748 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 232 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:12,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 347 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:36:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-23 06:36:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-07-23 06:36:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 116 states have internal predecessors, (126), 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-23 06:36:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-07-23 06:36:12,751 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 52 [2022-07-23 06:36:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:12,751 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-07-23 06:36:12,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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-23 06:36:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-07-23 06:36:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-23 06:36:12,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:12,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:36:12,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-23 06:36:12,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-23 06:36:12,970 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:36:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash 965522297, now seen corresponding path program 1 times [2022-07-23 06:36:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:36:12,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783883064] [2022-07-23 06:36:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:36:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:36:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:13,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:36:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:13,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:36:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:13,521 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-23 06:36:13,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:36:13,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783883064] [2022-07-23 06:36:13,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783883064] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:13,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335114002] [2022-07-23 06:36:13,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:13,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:36:13,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:36:13,522 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-23 06:36:13,523 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-23 06:36:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:13,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-23 06:36:13,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:13,726 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-23 06:36:13,861 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:13,861 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-23 06:36:13,933 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-23 06:36:14,036 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:36:14,037 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-23 06:36:14,159 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:14,160 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 30 treesize of output 17 [2022-07-23 06:36:14,165 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-23 06:36:14,254 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2773 (Array Int Int)) (v_ArrVal_2772 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2773) |c_#memory_$Pointer$.offset|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2772) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-07-23 06:36:14,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:14,289 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:36:14,289 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 36 treesize of output 40 [2022-07-23 06:36:14,300 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 06:36:14,300 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-23 06:36:14,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:14,305 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 34 treesize of output 34 [2022-07-23 06:36:14,355 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 35 treesize of output 23 [2022-07-23 06:36:14,455 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:14,455 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 35 treesize of output 18 [2022-07-23 06:36:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-23 06:36:14,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:14,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2781 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (|v_node_create_~temp~0#1.base_53| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_53| v_ArrVal_2780) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (not (= 0 (select |c_#valid| |v_node_create_~temp~0#1.base_53|))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_53| v_ArrVal_2781))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) .cse2))))) (not (< |v_node_create_~temp~0#1.base_53| |c_#StackHeapBarrier|)) (not (<= 0 .cse2))))) is different from false [2022-07-23 06:36:14,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335114002] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:14,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:14,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 46 [2022-07-23 06:36:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657560309] [2022-07-23 06:36:14,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:14,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-23 06:36:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:36:14,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-23 06:36:14,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2197, Unknown=2, NotChecked=190, Total=2550 [2022-07-23 06:36:14,650 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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-23 06:36:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:15,866 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-07-23 06:36:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:36:15,867 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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 54 [2022-07-23 06:36:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:15,868 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:36:15,868 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:36:15,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=317, Invalid=3595, Unknown=2, NotChecked=246, Total=4160 [2022-07-23 06:36:15,869 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 240 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:15,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1499 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1437 Invalid, 0 Unknown, 113 Unchecked, 0.7s Time] [2022-07-23 06:36:15,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:36:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-23 06:36:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 116 states have internal predecessors, (125), 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-23 06:36:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2022-07-23 06:36:15,872 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 54 [2022-07-23 06:36:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:15,872 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2022-07-23 06:36:15,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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-23 06:36:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2022-07-23 06:36:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 06:36:15,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:15,873 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-23 06:36:15,892 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-23 06:36:16,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-23 06:36:16,092 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:36:16,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:16,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2042113126, now seen corresponding path program 3 times [2022-07-23 06:36:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:36:16,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7478417] [2022-07-23 06:36:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:36:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:16,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:36:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:16,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:36:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 06:36:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:16,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-23 06:36:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:16,140 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-23 06:36:16,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:36:16,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7478417] [2022-07-23 06:36:16,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7478417] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:16,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105354139] [2022-07-23 06:36:16,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 06:36:16,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:36:16,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:36:16,142 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-23 06:36:16,144 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-23 06:36:16,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-23 06:36:16,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:36:16,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:36:16,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:16,384 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-23 06:36:16,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:16,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105354139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:16,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:36:16,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-23 06:36:16,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738542847] [2022-07-23 06:36:16,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:16,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:36:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:36:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:36:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:36:16,386 INFO L87 Difference]: Start difference. First operand 124 states and 135 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-23 06:36:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:16,394 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-07-23 06:36:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:36:16,395 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-23 06:36:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:16,395 INFO L225 Difference]: With dead ends: 92 [2022-07-23 06:36:16,395 INFO L226 Difference]: Without dead ends: 92 [2022-07-23 06:36:16,396 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-23 06:36:16,397 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 70 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:16,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 109 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:36:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-23 06:36:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-23 06:36:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 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-23 06:36:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-07-23 06:36:16,399 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 58 [2022-07-23 06:36:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:16,399 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-07-23 06:36:16,400 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-23 06:36:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-07-23 06:36:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 06:36:16,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:16,400 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] [2022-07-23 06:36:16,434 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-23 06:36:16,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:36:16,615 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-23 06:36:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:16,616 INFO L85 PathProgramCache]: Analyzing trace with hash -214738826, now seen corresponding path program 1 times [2022-07-23 06:36:16,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:36:16,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347708426] [2022-07-23 06:36:16,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:16,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:36:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:17,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:36:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:17,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:36:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:17,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 06:36:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:17,790 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-23 06:36:17,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:36:17,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347708426] [2022-07-23 06:36:17,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347708426] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:17,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379551512] [2022-07-23 06:36:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:17,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:36:17,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:36:17,792 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-23 06:36:17,793 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-23 06:36:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:17,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 177 conjunts are in the unsatisfiable core [2022-07-23 06:36:18,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:18,041 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-23 06:36:18,249 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-23 06:36:18,372 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:18,372 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-23 06:36:18,498 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-23 06:36:18,505 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-23 06:36:18,655 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:36:18,655 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-23 06:36:18,658 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-23 06:36:18,863 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:18,864 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 48 treesize of output 27 [2022-07-23 06:36:18,868 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-23 06:36:19,043 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-23 06:36:21,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:21,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:21,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:21,031 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-23 06:36:21,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:21,042 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:36:21,043 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 64 treesize of output 53 [2022-07-23 06:36:21,051 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 06:36:21,051 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-23 06:36:21,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:21,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:21,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:36:21,821 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:36:21,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 49 treesize of output 27 [2022-07-23 06:36:22,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:22,151 INFO L356 Elim1Store]: treesize reduction 57, result has 21.9 percent of original size [2022-07-23 06:36:22,151 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 7 new quantified variables, introduced 12 case distinctions, treesize of input 78 treesize of output 51 [2022-07-23 06:36:22,365 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 19 treesize of output 18 [2022-07-23 06:36:22,411 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 11 treesize of output 7 [2022-07-23 06:36:22,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:22,422 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-23 06:36:22,426 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-23 06:36:22,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:22,502 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 44 treesize of output 31 [2022-07-23 06:36:22,506 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-23 06:36:22,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:22,512 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-23 06:36:22,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:22,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2022-07-23 06:36:22,620 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-23 06:36:22,648 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-23 06:36:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:36:22,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:22,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3203 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |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_prepend_~last~1#1.base| v_ArrVal_3203) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-23 06:36:22,812 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 178 treesize of output 174 [2022-07-23 06:36:22,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:22,818 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 150 [2022-07-23 06:36:22,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:22,826 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 246 treesize of output 237 [2022-07-23 06:36:22,832 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 222 treesize of output 214 [2022-07-23 06:36:24,293 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse18 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse17 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse26 (not .cse18))) (let ((.cse12 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_164 Int)) (or (forall ((v_arrayElimCell_167 Int)) (let ((.cse64 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202)) (.cse65 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse64 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse65)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse64 v_arrayElimCell_164) .cse65))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)))))))) (.cse14 (or .cse18 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (let ((.cse61 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202))) (let ((.cse62 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse63 (select .cse61 v_arrayElimCell_164))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse61 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse62)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse63 .cse62)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse63 (+ v_arrayElimCell_167 4))))))))) (.cse16 (or .cse26 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int))) (or (forall ((v_arrayElimCell_167 Int)) (let ((.cse59 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202)) (.cse60 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse59 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse60)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse59 v_arrayElimCell_164) .cse60))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))))))) (.cse36 (not .cse17)) (.cse27 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_167 4))))) (.cse38 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164))) (or (= (select .cse58 (+ v_arrayElimCell_166 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse58 (+ v_arrayElimCell_167 4))))))) (.cse41 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_166 4))) (forall ((v_arrayElimCell_164 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_166 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_167 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_167 4))))))))) (.cse1 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int))) (or (forall ((v_arrayElimCell_164 Int)) (or (forall ((v_arrayElimCell_167 Int)) (let ((.cse56 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202)) (.cse57 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse56 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse57)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse56 v_arrayElimCell_164) .cse57))))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_166 4)) |c_ULTIMATE.start_main_~uneq~0#1|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_166 4)))))) (.cse8 (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (let ((.cse54 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202))) (let ((.cse53 (select .cse54 v_arrayElimCell_164)) (.cse55 (+ v_arrayElimCell_167 4))) (or (= (select .cse53 (+ v_arrayElimCell_166 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse54 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse55)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 .cse55)))))) .cse26)) (.cse10 (or .cse18 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (let ((.cse52 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202))) (let ((.cse51 (+ v_arrayElimCell_166 4)) (.cse50 (select .cse52 v_arrayElimCell_164))) (or (= (select .cse50 .cse51) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse51)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 (+ v_arrayElimCell_167 4))))))))) (.cse28 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (let ((.cse48 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202)) (.cse49 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse48 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse49)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse48 v_arrayElimCell_164) .cse49)))))) (.cse30 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_167 4))))) (.cse7 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse47 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse47 (+ v_arrayElimCell_167 4))))))) (.cse11 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse13 (or .cse46 .cse11)) (.cse15 (or .cse46 .cse7)) (.cse0 (or .cse26 (let ((.cse42 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202))) (let ((.cse43 (select .cse45 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse44 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse43 .cse44)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse43 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse45 v_arrayElimCell_164) .cse44)))))))) (and .cse28 .cse42 (or (and .cse28 .cse42 .cse30) .cse17))))) (.cse6 (and .cse1 .cse8 .cse10)) (.cse2 (or .cse18 (and .cse1 .cse38 .cse41))) (.cse3 (or .cse18 (and .cse1 .cse41))) (.cse4 (or .cse18 (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_166 4)) |c_ULTIMATE.start_main_~uneq~0#1|)) (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202)) (.cse40 (+ v_arrayElimCell_166 4))) (or (= (select (select .cse39 v_arrayElimCell_164) .cse40) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse39 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse40)))))))) (.cse5 (or (and .cse1 .cse38 .cse8 .cse10) .cse17)) (.cse9 (or .cse36 .cse26 (and .cse27 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 (+ v_arrayElimCell_167 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 (+ v_arrayElimCell_166 4))))))))) (.cse24 (not .cse7)) (.cse25 (not .cse11)) (.cse23 (and .cse12 .cse14 .cse16)) (.cse19 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int))) (or (forall ((v_arrayElimCell_164 Int)) (or (forall ((v_arrayElimCell_167 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_167 4)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))))))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse7) .cse8 .cse9 .cse10) .cse11) .cse12 (or (and .cse12 .cse13 .cse14 .cse15 .cse16) .cse17) (or .cse18 (and .cse12 .cse13 .cse15 .cse19)) (or .cse18 (let ((.cse20 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)))))) (and (or .cse20 .cse11) (or .cse7 .cse20) (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202)) (.cse22 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse22)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_164) .cse22)))))))) .cse16 (or .cse11 .cse23) (or .cse24 .cse25 (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_167 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_167 4)))))) (or .cse18 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))))) (or .cse26 .cse27))) (or .cse26 (let ((.cse29 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202))) (let ((.cse31 (select .cse33 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse32 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 .cse32)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse33 v_arrayElimCell_164) .cse32)))))))) (and (or (and .cse28 .cse29 (or .cse7 .cse30) (or .cse11 .cse30)) .cse17) (or .cse24 .cse25 (and .cse28 .cse29)) .cse28 .cse29))) (or (and .cse0 .cse1 (or .cse6 .cse11) .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10) .cse7) (or (let ((.cse34 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int)) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 (+ v_arrayElimCell_167 4)))))))) (and (or .cse24 .cse25 (and .cse34 .cse27)) .cse34 .cse27)) .cse36 .cse26) (or .cse7 .cse23) (or .cse18 (and .cse12 .cse19))))))) is different from false [2022-07-23 06:37:08,473 WARN L233 SmtUtils]: Spent 38.71s on a formula simplification. DAG size of input: 156 DAG size of output: 120 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:37:20,824 WARN L233 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 111 DAG size of output: 111 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:37:28,106 WARN L233 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 116 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:37:37,255 WARN L233 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:37:45,948 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:37:56,350 WARN L233 SmtUtils]: Spent 8.82s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:38:03,450 WARN L233 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:38:16,685 WARN L233 SmtUtils]: Spent 10.17s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:38:26,520 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:38:27,071 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse48 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse48)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse48))) (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse9 (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse17 (not .cse9)) (.cse19 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse45 (select .cse46 v_arrayElimCell_164)) (.cse47 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse47)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse47))))))) (.cse24 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse44 (select .cse42 v_arrayElimCell_164)) (.cse43 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse43)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse44 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse44 .cse43))))))) (.cse26 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_166 4))) (forall ((v_arrayElimCell_164 Int)) (or (forall ((v_arrayElimCell_167 Int)) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse41 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse40 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse41)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse40 v_arrayElimCell_164) .cse41))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_166 4)))))))) (.cse18 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse20 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_164 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_167 Int)) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse39 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse39)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse38 v_arrayElimCell_164) .cse39)))))))))) (.cse23 (not .cse20)) (.cse13 (not .cse18)) (.cse27 (and .cse24 .cse26)) (.cse25 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse37 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 (+ v_arrayElimCell_167 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 (+ v_arrayElimCell_166 4))))))) (.cse3 (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse28 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_167 4))))) (.cse12 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse36 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse35 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse36)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse35 v_arrayElimCell_164) .cse36)))))) (.cse29 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse32 (select .cse34 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse33 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 .cse33)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse34 v_arrayElimCell_164) .cse33))))))) (.cse5 (or .cse17 .cse19))) (and (or .cse3 (and .cse4 .cse5 (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse7 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse8 (select .cse6 v_arrayElimCell_164))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ v_arrayElimCell_167 4))))))) .cse9))) (or (and .cse4 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_164 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_167 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_167 4))))))))) .cse9) (or (let ((.cse11 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse15 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 .cse15)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse16 v_arrayElimCell_164) .cse15)))))))) (let ((.cse10 (and .cse11 .cse12))) (and (or .cse3 .cse10) .cse11 .cse12 (or .cse13 .cse10)))) .cse17) (or .cse18 .cse19) .cse4 (or (and .cse20 .cse18 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse22 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse22)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_164) .cse22)))))) .cse9) (or .cse23 .cse13 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_167 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_167 4))))))) (or .cse20 .cse19) (or (and .cse24 .cse25 .cse26 (or .cse27 .cse20) .cse3 .cse28 .cse12 .cse29) .cse18) (or (not .cse3) .cse17 (let ((.cse30 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ v_arrayElimCell_167 4)))))))) (and (or .cse23 .cse13 (and .cse28 .cse30)) .cse28 .cse30))) (or (and (or .cse27 .cse18) .cse24 .cse25 .cse26 .cse3 .cse28 .cse12 .cse29) .cse20) .cse5)))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.base| 0))))) is different from false [2022-07-23 06:38:27,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse48 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse48)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse48))) (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse9 (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse17 (not .cse9)) (.cse19 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse45 (select .cse46 v_arrayElimCell_164)) (.cse47 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse47)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse47))))))) (.cse24 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse44 (select .cse42 v_arrayElimCell_164)) (.cse43 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse43)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse44 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse44 .cse43))))))) (.cse26 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_166 4))) (forall ((v_arrayElimCell_164 Int)) (or (forall ((v_arrayElimCell_167 Int)) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse41 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse40 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse41)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse40 v_arrayElimCell_164) .cse41))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_166 4)))))))) (.cse18 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse20 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_164 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_167 Int)) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse39 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse39)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse38 v_arrayElimCell_164) .cse39)))))))))) (.cse23 (not .cse20)) (.cse13 (not .cse18)) (.cse27 (and .cse24 .cse26)) (.cse25 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse37 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 (+ v_arrayElimCell_167 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 (+ v_arrayElimCell_166 4))))))) (.cse3 (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse28 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_167 4))))) (.cse12 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse36 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse35 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse36)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse35 v_arrayElimCell_164) .cse36)))))) (.cse29 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse32 (select .cse34 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse33 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 .cse33)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse34 v_arrayElimCell_164) .cse33))))))) (.cse5 (or .cse17 .cse19))) (and (or .cse3 (and .cse4 .cse5 (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse7 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse8 (select .cse6 v_arrayElimCell_164))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ v_arrayElimCell_167 4))))))) .cse9))) (or (and .cse4 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_164 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_167 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_167 4))))))))) .cse9) (or (let ((.cse11 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse15 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 .cse15)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse16 v_arrayElimCell_164) .cse15)))))))) (let ((.cse10 (and .cse11 .cse12))) (and (or .cse3 .cse10) .cse11 .cse12 (or .cse13 .cse10)))) .cse17) (or .cse18 .cse19) .cse4 (or (and .cse20 .cse18 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse22 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse22)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_164) .cse22)))))) .cse9) (or .cse23 .cse13 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (forall ((v_arrayElimCell_167 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_167 4))))))) (or .cse20 .cse19) (or (and .cse24 .cse25 .cse26 (or .cse27 .cse20) .cse3 .cse28 .cse12 .cse29) .cse18) (or (not .cse3) .cse17 (let ((.cse30 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ v_arrayElimCell_167 4)))))))) (and (or .cse23 .cse13 (and .cse28 .cse30)) .cse28 .cse30))) (or (and (or .cse27 .cse18) .cse24 .cse25 .cse26 .cse3 .cse28 .cse12 .cse29) .cse20) .cse5)))) (and (= .cse48 0) (= .cse0 0))))) is different from false [2022-07-23 06:38:28,009 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse48 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse48)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse48))) (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse20 (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse14 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse45 (select .cse47 v_arrayElimCell_164)) (.cse46 (+ v_arrayElimCell_167 4))) (or (= (select .cse45 .cse46) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse47 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse46))))))) (.cse19 (not .cse20)) (.cse12 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ v_arrayElimCell_166 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_164 Int)) (or (forall ((v_arrayElimCell_167 Int)) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse44 (+ v_arrayElimCell_167 4))) (or (= (select (select .cse43 v_arrayElimCell_164) .cse44) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse43 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse44))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_166 4)))))))) (.cse11 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse40 (select .cse42 v_arrayElimCell_164)) (.cse41 (+ v_arrayElimCell_167 4))) (or (= (select .cse40 .cse41) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse40 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse41)))))))) (let ((.cse7 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse39 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (or (= (select .cse39 (+ v_arrayElimCell_166 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 (+ v_arrayElimCell_167 4))))))) (.cse10 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse38 (select .cse36 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse37 (+ v_arrayElimCell_167 4))) (or (= (select (select .cse36 v_arrayElimCell_164) .cse37) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse38 (+ v_arrayElimCell_166 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse38 .cse37))))))) (.cse4 (and .cse6 .cse11)) (.cse8 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ v_arrayElimCell_167 4))))) (.cse16 (not .cse12)) (.cse13 (or .cse14 .cse19)) (.cse23 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (forall ((v_arrayElimCell_164 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (forall ((v_arrayElimCell_167 Int)) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse35 (+ v_arrayElimCell_167 4))) (or (= (select (select .cse34 v_arrayElimCell_164) .cse35) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse34 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse35))))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4)))))) (.cse9 (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (not .cse5)) (.cse3 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse33 (+ v_arrayElimCell_167 4))) (or (= (select (select .cse32 v_arrayElimCell_164) .cse33) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse32 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse33))))))) (and (or (and .cse3 (or .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (or .cse5 (and .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or .cse4 .cse12))) .cse13 (or .cse14 .cse5) (or (not .cse9) (let ((.cse15 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ v_arrayElimCell_167 4)))))))) (and .cse8 .cse15 (or .cse16 .cse17 (and .cse8 .cse15)))) .cse19) (or .cse14 .cse12) (or .cse20 (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202)) (.cse22 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_164) .cse22)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse22))))) .cse12 .cse5)) .cse23 (or .cse16 .cse17 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (forall ((v_arrayElimCell_167 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ v_arrayElimCell_167 4))))))) (or (and .cse13 (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse24 (select .cse26 v_arrayElimCell_164)) (.cse25 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (or (= (select .cse24 (+ v_arrayElimCell_167 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 .cse25)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse26 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse25)))))) .cse20) .cse23) .cse9) (or .cse20 (and .cse23 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (forall ((v_arrayElimCell_164 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (forall ((v_arrayElimCell_167 Int)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_167 4)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (or (let ((.cse27 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse31 (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse30 (+ v_arrayElimCell_167 4))) (or (= (select (select .cse29 v_arrayElimCell_164) .cse30) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 .cse30)))))))) (let ((.cse28 (and .cse3 .cse27))) (and .cse3 .cse27 (or .cse28 .cse9) (or .cse17 .cse28)))) .cse19))))) (and (= .cse48 0) (= .cse0 0))))) is different from false [2022-07-23 06:38:46,531 WARN L233 SmtUtils]: Spent 18.19s on a formula simplification that was a NOOP. DAG size: 338 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-23 06:38:46,531 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:46,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 37 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 37 new quantified variables, introduced 74 case distinctions, treesize of input 6740 treesize of output 12238 [2022-07-23 06:39:01,439 INFO L244 Elim1Store]: Index analysis took 5325 ms