./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all.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 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:20:40,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:20:40,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:20:40,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:20:40,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:20:40,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:20:40,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:20:40,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:20:40,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:20:40,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:20:40,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:20:40,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:20:40,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:20:40,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:20:40,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:20:40,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:20:40,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:20:40,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:20:40,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:20:40,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:20:40,359 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:20:40,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:20:40,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:20:40,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:20:40,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:20:40,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:20:40,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:20:40,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:20:40,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:20:40,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:20:40,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:20:40,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:20:40,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:20:40,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:20:40,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:20:40,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:20:40,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:20:40,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:20:40,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:20:40,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:20:40,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:20:40,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:20:40,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:20:40,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:20:40,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:20:40,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:20:40,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:20:40,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:20:40,403 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:20:40,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:20:40,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:20:40,404 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:20:40,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:20:40,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:20:40,405 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:20:40,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:20:40,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:20:40,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:20:40,405 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:20:40,405 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:20:40,406 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:20:40,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:20:40,406 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:20:40,406 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:20:40,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:20:40,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:20:40,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:20:40,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:20:40,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:20:40,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:20:40,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:20:40,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:20:40,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:20:40,408 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 -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2022-07-12 19:20:40,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:20:40,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:20:40,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:20:40,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:20:40,613 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:20:40,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-07-12 19:20:40,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06b7f33f0/cba7dc30f9a446babe0b1a44ebe6472d/FLAG169b436bf [2022-07-12 19:20:41,075 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:20:41,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-07-12 19:20:41,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06b7f33f0/cba7dc30f9a446babe0b1a44ebe6472d/FLAG169b436bf [2022-07-12 19:20:41,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06b7f33f0/cba7dc30f9a446babe0b1a44ebe6472d [2022-07-12 19:20:41,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:20:41,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:20:41,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:20:41,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:20:41,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:20:41,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41, skipping insertion in model container [2022-07-12 19:20:41,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:20:41,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:20:41,336 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/sll2n_update_all.i[24218,24231] [2022-07-12 19:20:41,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:20:41,350 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:20:41,394 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/sll2n_update_all.i[24218,24231] [2022-07-12 19:20:41,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:20:41,414 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:20:41,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41 WrapperNode [2022-07-12 19:20:41,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:20:41,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:20:41,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:20:41,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:20:41,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,453 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2022-07-12 19:20:41,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:20:41,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:20:41,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:20:41,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:20:41,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:20:41,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:20:41,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:20:41,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:20:41,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (1/1) ... [2022-07-12 19:20:41,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:20:41,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:20:41,511 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-12 19:20:41,512 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-12 19:20:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:20:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:20:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:20:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:20:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:20:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:20:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:20:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:20:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:20:41,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:20:41,606 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:20:41,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:20:41,829 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:20:41,833 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:20:41,833 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 19:20:41,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:20:41 BoogieIcfgContainer [2022-07-12 19:20:41,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:20:41,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:20:41,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:20:41,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:20:41,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:20:41" (1/3) ... [2022-07-12 19:20:41,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11698149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:20:41, skipping insertion in model container [2022-07-12 19:20:41,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:20:41" (2/3) ... [2022-07-12 19:20:41,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11698149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:20:41, skipping insertion in model container [2022-07-12 19:20:41,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:20:41" (3/3) ... [2022-07-12 19:20:41,841 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2022-07-12 19:20:41,851 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:20:41,851 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-07-12 19:20:41,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:20:41,891 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@7bf75f85, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44253b62 [2022-07-12 19:20:41,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-07-12 19:20:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:20:41,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:41,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:20:41,906 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2022-07-12 19:20:41,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:41,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155488499] [2022-07-12 19:20:41,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:42,058 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-12 19:20:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:42,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155488499] [2022-07-12 19:20:42,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155488499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:20:42,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:20:42,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:20:42,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200649854] [2022-07-12 19:20:42,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:20:42,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:20:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:42,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:20:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:20:42,096 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:42,179 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-07-12 19:20:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:20:42,181 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 19:20:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:42,187 INFO L225 Difference]: With dead ends: 109 [2022-07-12 19:20:42,188 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:20:42,189 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-12 19:20:42,193 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:42,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:20:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:20:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-07-12 19:20:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-07-12 19:20:42,226 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2022-07-12 19:20:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:42,226 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-07-12 19:20:42,227 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-07-12 19:20:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:20:42,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:42,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:20:42,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:20:42,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:42,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:42,229 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2022-07-12 19:20:42,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:42,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233854585] [2022-07-12 19:20:42,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:42,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:42,287 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-12 19:20:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:42,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233854585] [2022-07-12 19:20:42,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233854585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:20:42,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:20:42,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:20:42,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089311712] [2022-07-12 19:20:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:20:42,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:20:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:42,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:20:42,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:20:42,296 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:42,355 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-07-12 19:20:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:20:42,356 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 19:20:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:42,359 INFO L225 Difference]: With dead ends: 102 [2022-07-12 19:20:42,359 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 19:20:42,362 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-12 19:20:42,363 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:42,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:20:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 19:20:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-07-12 19:20:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-07-12 19:20:42,371 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2022-07-12 19:20:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:42,372 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-07-12 19:20:42,372 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-07-12 19:20:42,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:20:42,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:42,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:42,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:20:42,374 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:42,375 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2022-07-12 19:20:42,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:42,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482756981] [2022-07-12 19:20:42,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:42,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:42,399 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-12 19:20:42,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:42,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482756981] [2022-07-12 19:20:42,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482756981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:20:42,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:20:42,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:20:42,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153489228] [2022-07-12 19:20:42,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:20:42,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:20:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:42,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:20:42,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:20:42,403 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:42,410 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-07-12 19:20:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:20:42,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 19:20:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:42,413 INFO L225 Difference]: With dead ends: 68 [2022-07-12 19:20:42,413 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 19:20:42,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12 19:20:42,415 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:42,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:20:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 19:20:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-07-12 19:20:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-07-12 19:20:42,422 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2022-07-12 19:20:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:42,423 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-07-12 19:20:42,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-07-12 19:20:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:20:42,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:42,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:42,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:20:42,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:42,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:42,425 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2022-07-12 19:20:42,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:42,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624638304] [2022-07-12 19:20:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:42,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:42,475 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-12 19:20:42,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:42,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624638304] [2022-07-12 19:20:42,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624638304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:20:42,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:20:42,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:20:42,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607689035] [2022-07-12 19:20:42,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:20:42,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:20:42,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:42,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:20:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:20:42,478 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:42,535 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-07-12 19:20:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:20:42,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:20:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:42,536 INFO L225 Difference]: With dead ends: 76 [2022-07-12 19:20:42,536 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 19:20:42,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:20:42,537 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:42,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:20:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 19:20:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-07-12 19:20:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-07-12 19:20:42,540 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2022-07-12 19:20:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:42,541 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-07-12 19:20:42,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-07-12 19:20:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:20:42,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:42,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:42,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:20:42,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:42,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:42,542 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2022-07-12 19:20:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:42,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972889100] [2022-07-12 19:20:42,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:42,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:42,594 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-12 19:20:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:42,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972889100] [2022-07-12 19:20:42,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972889100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:20:42,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:20:42,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:20:42,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222880602] [2022-07-12 19:20:42,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:20:42,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:20:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:20:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:20:42,598 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:42,662 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-07-12 19:20:42,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:20:42,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:20:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:42,663 INFO L225 Difference]: With dead ends: 61 [2022-07-12 19:20:42,663 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 19:20:42,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:20:42,664 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:42,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:20:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 19:20:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-07-12 19:20:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-07-12 19:20:42,667 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2022-07-12 19:20:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:42,667 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-07-12 19:20:42,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-07-12 19:20:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 19:20:42,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:42,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:42,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:20:42,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:42,669 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2022-07-12 19:20:42,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:42,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821597330] [2022-07-12 19:20:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:20:42,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821597330] [2022-07-12 19:20:42,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821597330] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:20:42,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286808451] [2022-07-12 19:20:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:42,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:20:42,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:20:42,704 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-12 19:20:42,729 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-12 19:20:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:42,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:20:42,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:20:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:20:42,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:20:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:20:42,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286808451] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:20:42,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:20:42,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-12 19:20:42,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448937430] [2022-07-12 19:20:42,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:20:42,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:20:42,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:42,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:20:42,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:20:42,885 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:42,894 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-07-12 19:20:42,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:20:42,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 19:20:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:42,895 INFO L225 Difference]: With dead ends: 65 [2022-07-12 19:20:42,895 INFO L226 Difference]: Without dead ends: 65 [2022-07-12 19:20:42,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:20:42,898 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:42,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:20:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-12 19:20:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-12 19:20:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-07-12 19:20:42,904 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2022-07-12 19:20:42,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:42,904 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-07-12 19:20:42,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-07-12 19:20:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:20:42,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:42,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:42,925 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-12 19:20:43,119 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-12 19:20:43,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:43,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:43,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2022-07-12 19:20:43,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:43,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600698791] [2022-07-12 19:20:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:43,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:20:43,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:43,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600698791] [2022-07-12 19:20:43,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600698791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:20:43,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:20:43,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:20:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740311184] [2022-07-12 19:20:43,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:20:43,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:20:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:43,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:20:43,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:20:43,219 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:43,392 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-07-12 19:20:43,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:20:43,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:20:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:43,393 INFO L225 Difference]: With dead ends: 116 [2022-07-12 19:20:43,394 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 19:20:43,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:20:43,395 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 379 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:43,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 141 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:20:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 19:20:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2022-07-12 19:20:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-12 19:20:43,401 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2022-07-12 19:20:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:43,401 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-12 19:20:43,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-12 19:20:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:20:43,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:43,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:43,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:20:43,403 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:43,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2022-07-12 19:20:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:43,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949733557] [2022-07-12 19:20:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:20:43,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:43,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949733557] [2022-07-12 19:20:43,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949733557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:20:43,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:20:43,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:20:43,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677710211] [2022-07-12 19:20:43,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:20:43,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:20:43,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:43,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:20:43,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:20:43,509 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:43,707 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-07-12 19:20:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:20:43,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:20:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:43,708 INFO L225 Difference]: With dead ends: 103 [2022-07-12 19:20:43,708 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 19:20:43,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:20:43,709 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 389 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:43,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 103 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:20:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 19:20:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 68. [2022-07-12 19:20:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-07-12 19:20:43,712 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2022-07-12 19:20:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:43,712 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-07-12 19:20:43,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-07-12 19:20:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:20:43,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:43,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:43,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 19:20:43,713 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:43,714 INFO L85 PathProgramCache]: Analyzing trace with hash -893075880, now seen corresponding path program 1 times [2022-07-12 19:20:43,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:43,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266207927] [2022-07-12 19:20:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:43,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:20:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:43,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266207927] [2022-07-12 19:20:43,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266207927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:20:43,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:20:43,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:20:43,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711252093] [2022-07-12 19:20:43,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:20:43,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:20:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:43,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:20:43,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:20:43,778 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:43,937 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-07-12 19:20:43,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:20:43,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:20:43,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:43,938 INFO L225 Difference]: With dead ends: 103 [2022-07-12 19:20:43,938 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 19:20:43,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:20:43,940 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 363 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:43,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 124 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:20:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 19:20:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-07-12 19:20:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-07-12 19:20:43,951 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 28 [2022-07-12 19:20:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:43,952 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-07-12 19:20:43,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-07-12 19:20:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:20:43,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:43,953 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:43,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:20:43,954 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash -893075879, now seen corresponding path program 1 times [2022-07-12 19:20:43,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:43,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38343925] [2022-07-12 19:20:43,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:20:44,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:44,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38343925] [2022-07-12 19:20:44,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38343925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:20:44,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729409838] [2022-07-12 19:20:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:44,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:20:44,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:20:44,025 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-12 19:20:44,026 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-12 19:20:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:44,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:20:44,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:20:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:20:44,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:20:44,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729409838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:20:44,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:20:44,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-12 19:20:44,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909084499] [2022-07-12 19:20:44,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:20:44,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:20:44,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:44,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:20:44,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:20:44,157 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:44,171 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2022-07-12 19:20:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:20:44,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:20:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:44,172 INFO L225 Difference]: With dead ends: 103 [2022-07-12 19:20:44,172 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 19:20:44,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:20:44,173 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 72 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:44,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 106 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:20:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 19:20:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 73. [2022-07-12 19:20:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-07-12 19:20:44,175 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2022-07-12 19:20:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:44,176 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-07-12 19:20:44,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-07-12 19:20:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:20:44,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:44,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:44,195 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-12 19:20:44,377 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,SelfDestructingSolverStorable9 [2022-07-12 19:20:44,377 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2022-07-12 19:20:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:44,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133705806] [2022-07-12 19:20:44,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:20:44,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133705806] [2022-07-12 19:20:44,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133705806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:20:44,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:20:44,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:20:44,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014037329] [2022-07-12 19:20:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:20:44,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:20:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:20:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:20:44,421 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:44,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:44,444 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2022-07-12 19:20:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:20:44,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 19:20:44,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:44,445 INFO L225 Difference]: With dead ends: 147 [2022-07-12 19:20:44,445 INFO L226 Difference]: Without dead ends: 147 [2022-07-12 19:20:44,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:20:44,446 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 86 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:44,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 161 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:20:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-12 19:20:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 74. [2022-07-12 19:20:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-07-12 19:20:44,449 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 29 [2022-07-12 19:20:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:44,449 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-07-12 19:20:44,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-07-12 19:20:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:20:44,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:44,452 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:44,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:20:44,452 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1668563827, now seen corresponding path program 1 times [2022-07-12 19:20:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:44,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357709504] [2022-07-12 19:20:44,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:20:44,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:44,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357709504] [2022-07-12 19:20:44,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357709504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:20:44,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804471185] [2022-07-12 19:20:44,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:44,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:20:44,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:20:44,512 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-12 19:20:44,520 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-12 19:20:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:44,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:20:44,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:20:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:20:44,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:20:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:20:44,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804471185] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:20:44,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:20:44,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-12 19:20:44,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592717063] [2022-07-12 19:20:44,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:20:44,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:20:44,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:44,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:20:44,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:20:44,708 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:44,741 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2022-07-12 19:20:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:20:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:20:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:44,742 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:20:44,743 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:20:44,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:20:44,743 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 127 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:44,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 275 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:20:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:20:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2022-07-12 19:20:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.44) internal successors, (108), 89 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-07-12 19:20:44,746 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 33 [2022-07-12 19:20:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:44,746 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-07-12 19:20:44,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-07-12 19:20:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:20:44,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:44,747 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:44,763 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-12 19:20:44,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:20:44,963 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:44,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash -146010198, now seen corresponding path program 1 times [2022-07-12 19:20:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:44,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681895411] [2022-07-12 19:20:44,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:20:45,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:45,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681895411] [2022-07-12 19:20:45,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681895411] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:20:45,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73724430] [2022-07-12 19:20:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:45,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:20:45,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:20:45,154 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-12 19:20:45,155 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-12 19:20:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:45,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 19:20:45,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:20:45,258 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-12 19:20:45,286 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:20:45,286 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-12 19:20:45,344 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-12 19:20:45,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:20:45,475 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 23 treesize of output 22 [2022-07-12 19:20:45,509 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 21 treesize of output 9 [2022-07-12 19:20:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:20:45,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:20:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:20:52,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73724430] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:20:52,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:20:52,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-12 19:20:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654199578] [2022-07-12 19:20:52,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:20:52,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 19:20:52,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:20:52,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 19:20:52,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1066, Unknown=1, NotChecked=0, Total=1190 [2022-07-12 19:20:52,997 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:20:53,888 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2022-07-12 19:20:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 19:20:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:20:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:20:53,891 INFO L225 Difference]: With dead ends: 176 [2022-07-12 19:20:53,891 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 19:20:53,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=538, Invalid=2011, Unknown=1, NotChecked=0, Total=2550 [2022-07-12 19:20:53,892 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1417 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:20:53,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 563 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 684 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-07-12 19:20:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 19:20:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 100. [2022-07-12 19:20:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 99 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-07-12 19:20:53,895 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 34 [2022-07-12 19:20:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:20:53,896 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-07-12 19:20:53,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:20:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-07-12 19:20:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:20:53,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:20:53,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:20:53,917 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-12 19:20:54,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:20:54,115 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:20:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:54,116 INFO L85 PathProgramCache]: Analyzing trace with hash -146010197, now seen corresponding path program 1 times [2022-07-12 19:20:54,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:20:54,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616011434] [2022-07-12 19:20:54,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:54,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:20:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:20:54,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:20:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616011434] [2022-07-12 19:20:54,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616011434] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:20:54,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666692040] [2022-07-12 19:20:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:54,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:20:54,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:20:54,440 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-12 19:20:54,441 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-12 19:20:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:54,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-12 19:20:54,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:20:54,535 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-12 19:20:54,696 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:20:54,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:20:54,709 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:20:54,709 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-12 19:20:54,821 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 13 treesize of output 9 [2022-07-12 19:20:54,828 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-12 19:20:55,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:20:55,010 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 41 treesize of output 34 [2022-07-12 19:20:55,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:20:55,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 40 treesize of output 33 [2022-07-12 19:20:55,073 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 39 treesize of output 21 [2022-07-12 19:20:55,088 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 32 treesize of output 14 [2022-07-12 19:20:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:20:55,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:20:57,423 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0)))))))) is different from false [2022-07-12 19:20:59,441 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|)))) is different from false [2022-07-12 19:21:01,455 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) is different from false [2022-07-12 19:21:03,492 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))))))) is different from false [2022-07-12 19:21:03,502 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 15 [2022-07-12 19:21:03,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:03,512 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 33 [2022-07-12 19:21:03,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-07-12 19:21:03,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:03,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:15,987 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 48 treesize of output 44 [2022-07-12 19:21:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 19:21:16,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666692040] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:16,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:16,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 48 [2022-07-12 19:21:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128118254] [2022-07-12 19:21:16,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:16,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 19:21:16,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:16,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 19:21:16,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1853, Unknown=4, NotChecked=356, Total=2352 [2022-07-12 19:21:16,045 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:17,291 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#length| .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 8 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) .cse0) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (= .cse2 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))))) (<= 8 .cse0) (<= (+ .cse2 8) .cse3) (<= 8 .cse3) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2022-07-12 19:21:17,973 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select .cse1 .cse5)) (.cse3 (select .cse4 .cse5))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))))) (<= 8 (select |c_#length| (select .cse1 4))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (not (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ .cse3 8) (select |c_#length| .cse2)) (<= 0 .cse3) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select .cse4 4) 0)))) is different from false [2022-07-12 19:21:18,529 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select .cse1 .cse5)) (.cse3 (select .cse4 .cse5))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))))) (<= 8 (select |c_#length| (select .cse1 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (not (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ .cse3 8) (select |c_#length| .cse2)) (<= 0 .cse3) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select .cse4 4) 0)))) is different from false [2022-07-12 19:21:19,123 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse5)) (.cse3 (select .cse2 .cse5))) (and (= (select .cse0 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 0 .cse1) (<= 8 (select |c_#length| (select .cse2 4))) (<= (+ 8 .cse1) (select |c_#length| .cse3)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse4) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse3))))) is different from false [2022-07-12 19:21:19,702 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select .cse1 .cse5)) (.cse3 (select .cse0 .cse5))) (and (<= 8 (select |c_#length| (select .cse0 4))) (= (select .cse1 4) 0) (<= 0 .cse2) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ 8 .cse2) (select |c_#length| .cse3)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse3)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse4) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse4)))))))))) is different from false [2022-07-12 19:21:20,725 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#length| .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 8 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) .cse0) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (= .cse2 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))))) (<= 8 .cse0) (<= (+ .cse2 8) .cse3) (<= 8 .cse3) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2022-07-12 19:21:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:21,210 INFO L93 Difference]: Finished difference Result 228 states and 283 transitions. [2022-07-12 19:21:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 19:21:21,211 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:21:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:21,212 INFO L225 Difference]: With dead ends: 228 [2022-07-12 19:21:21,212 INFO L226 Difference]: Without dead ends: 228 [2022-07-12 19:21:21,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=396, Invalid=3056, Unknown=10, NotChecked=1230, Total=4692 [2022-07-12 19:21:21,213 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 592 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:21,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1387 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 856 Invalid, 0 Unknown, 739 Unchecked, 0.5s Time] [2022-07-12 19:21:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-12 19:21:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 108. [2022-07-12 19:21:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 107 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2022-07-12 19:21:21,218 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 34 [2022-07-12 19:21:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:21,219 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2022-07-12 19:21:21,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2022-07-12 19:21:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:21:21,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:21,220 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:21,239 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-12 19:21:21,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 19:21:21,428 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1013729350, now seen corresponding path program 2 times [2022-07-12 19:21:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:21,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910569736] [2022-07-12 19:21:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:21:21,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:21,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910569736] [2022-07-12 19:21:21,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910569736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:21,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907951865] [2022-07-12 19:21:21,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:21:21,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:21,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:21,479 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-12 19:21:21,480 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-12 19:21:21,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:21:21,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:21:21,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:21:21,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 19:21:21,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 19:21:21,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907951865] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:21,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:21,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-07-12 19:21:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063066805] [2022-07-12 19:21:21,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:21,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:21:21,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:21,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:21:21,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:21:21,643 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:21,697 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-07-12 19:21:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:21:21,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 19:21:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:21,698 INFO L225 Difference]: With dead ends: 100 [2022-07-12 19:21:21,699 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 19:21:21,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:21:21,699 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 203 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:21,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 136 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 19:21:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-07-12 19:21:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-07-12 19:21:21,701 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 37 [2022-07-12 19:21:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:21,702 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-07-12 19:21:21,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-07-12 19:21:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:21:21,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:21,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:21,726 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-12 19:21:21,916 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-12 19:21:21,916 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1104183591, now seen corresponding path program 2 times [2022-07-12 19:21:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:21,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50502458] [2022-07-12 19:21:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:21:21,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:21,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50502458] [2022-07-12 19:21:21,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50502458] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:21,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531577344] [2022-07-12 19:21:21,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:21:21,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:21,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:21,979 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-12 19:21:21,980 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-12 19:21:22,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:21:22,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:21:22,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:21:22,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:21:22,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:21:22,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531577344] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:22,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:22,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-12 19:21:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797245652] [2022-07-12 19:21:22,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:22,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:21:22,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:22,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:21:22,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:21:22,105 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:22,201 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-07-12 19:21:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:21:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 19:21:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:22,202 INFO L225 Difference]: With dead ends: 96 [2022-07-12 19:21:22,202 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 19:21:22,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:21:22,203 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 156 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:22,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 346 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:21:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 19:21:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-07-12 19:21:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.358974358974359) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-07-12 19:21:22,204 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 38 [2022-07-12 19:21:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:22,205 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-07-12 19:21:22,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-07-12 19:21:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:21:22,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:22,205 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:22,229 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-12 19:21:22,417 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-12 19:21:22,417 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1861613195, now seen corresponding path program 1 times [2022-07-12 19:21:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:22,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806445273] [2022-07-12 19:21:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:21:22,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:22,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806445273] [2022-07-12 19:21:22,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806445273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:22,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:22,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:21:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430468864] [2022-07-12 19:21:22,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:22,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:21:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:21:22,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:21:22,498 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:22,654 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2022-07-12 19:21:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:21:22,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-12 19:21:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:22,655 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:21:22,655 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 19:21:22,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:21:22,656 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 467 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:22,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 75 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:21:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 19:21:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2022-07-12 19:21:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-07-12 19:21:22,659 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 41 [2022-07-12 19:21:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:22,659 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-07-12 19:21:22,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-07-12 19:21:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:21:22,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:22,660 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:22,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 19:21:22,660 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1835573310, now seen corresponding path program 3 times [2022-07-12 19:21:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:22,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679975421] [2022-07-12 19:21:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:21:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:22,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679975421] [2022-07-12 19:21:22,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679975421] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:22,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890482102] [2022-07-12 19:21:22,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 19:21:22,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:22,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:22,712 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-12 19:21:22,713 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-12 19:21:22,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 19:21:22,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:21:22,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:21:22,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 19:21:22,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:21:22,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890482102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:22,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:21:22,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2022-07-12 19:21:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462625160] [2022-07-12 19:21:22,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:22,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:21:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:22,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:21:22,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:21:22,897 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:22,917 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-07-12 19:21:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:21:22,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 19:21:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:22,918 INFO L225 Difference]: With dead ends: 90 [2022-07-12 19:21:22,918 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 19:21:22,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:21:22,919 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:22,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 156 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 19:21:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-07-12 19:21:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-07-12 19:21:22,921 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 42 [2022-07-12 19:21:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:22,921 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-07-12 19:21:22,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-07-12 19:21:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:21:22,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:22,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:22,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 19:21:23,127 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,SelfDestructingSolverStorable17 [2022-07-12 19:21:23,128 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:23,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:23,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1595673087, now seen corresponding path program 1 times [2022-07-12 19:21:23,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:23,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383468151] [2022-07-12 19:21:23,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:23,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:21:23,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:23,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383468151] [2022-07-12 19:21:23,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383468151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:23,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:23,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:21:23,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911221056] [2022-07-12 19:21:23,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:23,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:21:23,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:23,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:21:23,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:21:23,185 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:23,199 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-07-12 19:21:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:21:23,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-12 19:21:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:23,201 INFO L225 Difference]: With dead ends: 81 [2022-07-12 19:21:23,201 INFO L226 Difference]: Without dead ends: 81 [2022-07-12 19:21:23,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:21:23,202 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 19 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:23,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-12 19:21:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-07-12 19:21:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-07-12 19:21:23,206 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 44 [2022-07-12 19:21:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:23,206 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-07-12 19:21:23,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-07-12 19:21:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:21:23,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:23,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:23,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 19:21:23,208 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2124312202, now seen corresponding path program 1 times [2022-07-12 19:21:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:23,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503160283] [2022-07-12 19:21:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:23,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:23,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503160283] [2022-07-12 19:21:23,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503160283] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:23,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372179832] [2022-07-12 19:21:23,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:23,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:23,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:23,613 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-12 19:21:23,614 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-12 19:21:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:23,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-12 19:21:23,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:23,748 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-12 19:21:23,870 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:21:23,871 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-12 19:21:23,958 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 13 treesize of output 9 [2022-07-12 19:21:24,128 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 20 treesize of output 19 [2022-07-12 19:21:24,133 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-12 19:21:24,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:24,236 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2022-07-12 19:21:24,314 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-12 19:21:24,434 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-12 19:21:24,515 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:24,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:24,614 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-12 19:21:24,622 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-12 19:21:24,632 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-07-12 19:21:24,643 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-12 19:21:24,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:24,657 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 32 treesize of output 33 [2022-07-12 19:21:24,663 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:24,663 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 58 treesize of output 61 [2022-07-12 19:21:24,667 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 23 treesize of output 21 [2022-07-12 19:21:24,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:24,683 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 32 treesize of output 33 [2022-07-12 19:21:24,686 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-07-12 19:21:24,689 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 23 treesize of output 21 [2022-07-12 19:21:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-12 19:21:25,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372179832] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:25,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:25,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 66 [2022-07-12 19:21:25,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304545892] [2022-07-12 19:21:25,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:25,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-12 19:21:25,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:25,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-12 19:21:25,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3573, Unknown=4, NotChecked=492, Total=4290 [2022-07-12 19:21:25,073 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:26,456 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-07-12 19:21:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 19:21:26,456 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-12 19:21:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:26,457 INFO L225 Difference]: With dead ends: 86 [2022-07-12 19:21:26,457 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 19:21:26,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=864, Invalid=6804, Unknown=4, NotChecked=700, Total=8372 [2022-07-12 19:21:26,459 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 395 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:26,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 746 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 952 Invalid, 0 Unknown, 342 Unchecked, 0.5s Time] [2022-07-12 19:21:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 19:21:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-07-12 19:21:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-07-12 19:21:26,461 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 45 [2022-07-12 19:21:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:26,461 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-07-12 19:21:26,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-07-12 19:21:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:21:26,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:26,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:26,478 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-12 19:21:26,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:26,667 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429550, now seen corresponding path program 1 times [2022-07-12 19:21:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:26,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861888986] [2022-07-12 19:21:26,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:27,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:27,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861888986] [2022-07-12 19:21:27,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861888986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:27,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170562666] [2022-07-12 19:21:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:27,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:27,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:27,188 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-12 19:21:27,189 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-12 19:21:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:27,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 19:21:27,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:27,319 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-12 19:21:27,419 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:21:27,419 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-12 19:21:27,491 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 13 treesize of output 9 [2022-07-12 19:21:27,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:21:27,652 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 22 treesize of output 21 [2022-07-12 19:21:27,772 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:21:27,772 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 34 treesize of output 35 [2022-07-12 19:21:27,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-12 19:21:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:21:27,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:27,972 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-12 19:21:27,972 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 21 treesize of output 20 [2022-07-12 19:21:27,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2022-07-12 19:21:27,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2022-07-12 19:21:27,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-07-12 19:21:27,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2022-07-12 19:21:28,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (v_ArrVal_1229 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1229))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) is different from false [2022-07-12 19:21:28,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2022-07-12 19:21:28,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) is different from false [2022-07-12 19:21:28,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) is different from false [2022-07-12 19:21:28,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) is different from false [2022-07-12 19:21:28,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:28,060 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 2 case distinctions, treesize of input 53 treesize of output 51 [2022-07-12 19:21:28,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:28,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:28,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:28,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 27 treesize of output 31 [2022-07-12 19:21:28,069 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 36 treesize of output 24 [2022-07-12 19:21:28,077 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 7 treesize of output 3 [2022-07-12 19:21:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-07-12 19:21:28,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170562666] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:28,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:28,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 21] total 60 [2022-07-12 19:21:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812822653] [2022-07-12 19:21:28,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:28,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-12 19:21:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:28,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-12 19:21:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2528, Unknown=9, NotChecked=972, Total=3660 [2022-07-12 19:21:28,212 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:28,742 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-07-12 19:21:28,745 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-12 19:21:28,747 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-12 19:21:28,767 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) is different from false [2022-07-12 19:21:28,772 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-07-12 19:21:28,939 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-07-12 19:21:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:29,864 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2022-07-12 19:21:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 19:21:29,864 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-12 19:21:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:29,867 INFO L225 Difference]: With dead ends: 128 [2022-07-12 19:21:29,867 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 19:21:29,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=568, Invalid=5177, Unknown=15, NotChecked=2430, Total=8190 [2022-07-12 19:21:29,869 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 597 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 880 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:29,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1068 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1599 Invalid, 0 Unknown, 880 Unchecked, 0.6s Time] [2022-07-12 19:21:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 19:21:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2022-07-12 19:21:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-07-12 19:21:29,871 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 51 [2022-07-12 19:21:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:29,871 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-07-12 19:21:29,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-07-12 19:21:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:21:29,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:29,872 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:29,889 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-12 19:21:30,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-12 19:21:30,077 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:30,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429551, now seen corresponding path program 1 times [2022-07-12 19:21:30,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:30,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879642287] [2022-07-12 19:21:30,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:30,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:30,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:30,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879642287] [2022-07-12 19:21:30,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879642287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:30,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368779694] [2022-07-12 19:21:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:30,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:30,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:30,681 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-12 19:21:30,682 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-12 19:21:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:30,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-12 19:21:30,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:30,817 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-12 19:21:30,909 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:21:30,909 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-12 19:21:30,976 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 13 treesize of output 9 [2022-07-12 19:21:31,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:21:31,134 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 22 treesize of output 21 [2022-07-12 19:21:31,138 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 6 treesize of output 5 [2022-07-12 19:21:31,285 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:21:31,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-12 19:21:31,288 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 41 treesize of output 41 [2022-07-12 19:21:31,434 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 39 treesize of output 21 [2022-07-12 19:21:31,436 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 32 treesize of output 14 [2022-07-12 19:21:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:21:31,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:31,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:31,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-07-12 19:21:31,978 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 400 treesize of output 364 [2022-07-12 19:21:31,992 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 110 treesize of output 102 [2022-07-12 19:21:32,015 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 194 treesize of output 178 [2022-07-12 19:21:32,059 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 120 treesize of output 112 [2022-07-12 19:21:32,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_prenex_6) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) is different from false [2022-07-12 19:21:32,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_prenex_6) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) |c_ULTIMATE.start_sll_create_#res#1.base|)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) is different from false [2022-07-12 19:21:33,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_prenex_6) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) is different from false [2022-07-12 19:21:33,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_prenex_6) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))))) is different from false [2022-07-12 19:21:33,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-07-12 19:21:33,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-07-12 19:21:33,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368779694] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:33,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:33,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 21] total 62 [2022-07-12 19:21:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124513738] [2022-07-12 19:21:33,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:33,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-12 19:21:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:33,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-12 19:21:33,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3261, Unknown=4, NotChecked=468, Total=3906 [2022-07-12 19:21:33,522 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 63 states, 62 states have (on average 2.274193548387097) internal successors, (141), 63 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:34,378 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (forall ((v_prenex_6 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_prenex_6) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-07-12 19:21:34,674 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((v_prenex_6 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_prenex_6) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) is different from false [2022-07-12 19:21:34,959 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((v_prenex_6 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_prenex_6) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) is different from false [2022-07-12 19:21:35,265 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((v_prenex_6 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_prenex_6) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) |c_ULTIMATE.start_sll_create_#res#1.base|)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) is different from false [2022-07-12 19:21:35,557 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_prenex_6) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-07-12 19:21:36,008 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (forall ((v_prenex_6 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_prenex_6) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-07-12 19:21:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:37,092 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2022-07-12 19:21:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 19:21:37,092 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.274193548387097) internal successors, (141), 63 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-12 19:21:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:37,093 INFO L225 Difference]: With dead ends: 136 [2022-07-12 19:21:37,093 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 19:21:37,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=636, Invalid=6534, Unknown=10, NotChecked=1750, Total=8930 [2022-07-12 19:21:37,095 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 800 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:37,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1197 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1389 Invalid, 0 Unknown, 716 Unchecked, 0.6s Time] [2022-07-12 19:21:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 19:21:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 82. [2022-07-12 19:21:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-07-12 19:21:37,097 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 51 [2022-07-12 19:21:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:37,097 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-07-12 19:21:37,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.274193548387097) internal successors, (141), 63 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-07-12 19:21:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:21:37,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:37,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:37,115 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-12 19:21:37,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 19:21:37,305 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429606, now seen corresponding path program 1 times [2022-07-12 19:21:37,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:37,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590999566] [2022-07-12 19:21:37,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:37,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:21:37,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:37,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590999566] [2022-07-12 19:21:37,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590999566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:37,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106852719] [2022-07-12 19:21:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:37,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:37,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:37,360 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-12 19:21:37,361 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-12 19:21:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:37,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:21:37,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:21:37,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:21:37,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106852719] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:37,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:37,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-12 19:21:37,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100895545] [2022-07-12 19:21:37,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:37,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:21:37,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:37,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:21:37,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:21:37,521 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:37,553 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-07-12 19:21:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:21:37,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-12 19:21:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:37,554 INFO L225 Difference]: With dead ends: 73 [2022-07-12 19:21:37,554 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 19:21:37,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:21:37,554 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 81 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:37,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 175 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 19:21:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-12 19:21:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-07-12 19:21:37,557 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 51 [2022-07-12 19:21:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:37,557 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-07-12 19:21:37,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-07-12 19:21:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 19:21:37,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:37,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:37,575 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-12 19:21:37,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 19:21:37,763 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2007861849, now seen corresponding path program 1 times [2022-07-12 19:21:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:37,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737556638] [2022-07-12 19:21:37,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:21:37,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:37,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737556638] [2022-07-12 19:21:37,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737556638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:37,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86529779] [2022-07-12 19:21:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:37,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:37,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:37,799 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-12 19:21:37,800 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-12 19:21:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:37,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:21:37,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:21:37,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:21:37,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86529779] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:37,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:37,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-12 19:21:37,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984509212] [2022-07-12 19:21:37,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:37,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:21:37,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:37,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:21:37,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:21:37,947 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:37,974 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-07-12 19:21:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:21:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-12 19:21:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:37,975 INFO L225 Difference]: With dead ends: 73 [2022-07-12 19:21:37,975 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 19:21:37,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:21:37,976 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 72 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:37,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:37,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 19:21:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-12 19:21:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.121212121212121) internal successors, (74), 72 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-07-12 19:21:37,978 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 52 [2022-07-12 19:21:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:37,978 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-07-12 19:21:37,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-07-12 19:21:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 19:21:37,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:37,979 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:37,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 19:21:38,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 19:21:38,188 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:38,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1192937808, now seen corresponding path program 1 times [2022-07-12 19:21:38,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:38,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830008097] [2022-07-12 19:21:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:38,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:38,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830008097] [2022-07-12 19:21:38,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830008097] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:38,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202770229] [2022-07-12 19:21:38,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:38,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:38,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:38,732 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-12 19:21:38,733 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-12 19:21:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:38,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 101 conjunts are in the unsatisfiable core [2022-07-12 19:21:38,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:38,875 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-12 19:21:38,908 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:21:38,908 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-12 19:21:38,973 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 13 treesize of output 9 [2022-07-12 19:21:39,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:21:39,113 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 22 treesize of output 21 [2022-07-12 19:21:39,116 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 6 treesize of output 5 [2022-07-12 19:21:39,339 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:21:39,340 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 66 treesize of output 63 [2022-07-12 19:21:39,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-07-12 19:21:39,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-07-12 19:21:39,543 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 39 treesize of output 21 [2022-07-12 19:21:39,546 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 23 treesize of output 11 [2022-07-12 19:21:39,575 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 22 treesize of output 10 [2022-07-12 19:21:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:39,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:39,840 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 86 treesize of output 64 [2022-07-12 19:21:39,851 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 86 treesize of output 64 [2022-07-12 19:21:39,858 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_1664 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1661 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-07-12 19:21:39,873 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1664 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1661 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-07-12 19:21:39,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1661 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-07-12 19:21:39,904 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1661 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-12 19:21:39,913 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1661 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2022-07-12 19:21:39,926 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 254 treesize of output 230 [2022-07-12 19:21:39,930 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 194 treesize of output 178 [2022-07-12 19:21:39,932 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 178 treesize of output 162 [2022-07-12 19:21:39,959 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) .cse3 (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (or (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) .cse3))) is different from false [2022-07-12 19:21:39,967 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-07-12 19:21:41,980 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-07-12 19:21:43,993 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))))))) is different from false [2022-07-12 19:21:46,006 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|)))) is different from false [2022-07-12 19:21:48,033 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|)))) is different from false [2022-07-12 19:21:48,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-07-12 19:21:48,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:48,046 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-12 19:21:48,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2022-07-12 19:21:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-12 19:21:48,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202770229] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:48,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:48,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 29] total 65 [2022-07-12 19:21:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660253330] [2022-07-12 19:21:48,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:48,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-12 19:21:48,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:48,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-12 19:21:48,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2721, Unknown=11, NotChecked=1254, Total=4160 [2022-07-12 19:21:48,169 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 65 states, 65 states have (on average 2.123076923076923) internal successors, (138), 65 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:48,524 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))))))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|)))) is different from false [2022-07-12 19:21:50,526 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-12 19:21:52,529 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-12 19:21:52,550 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1)))))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0)) is different from false [2022-07-12 19:21:52,554 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-07-12 19:21:52,744 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))))))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|)))) is different from false [2022-07-12 19:21:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:53,688 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-07-12 19:21:53,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 19:21:53,689 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.123076923076923) internal successors, (138), 65 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-12 19:21:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:53,689 INFO L225 Difference]: With dead ends: 78 [2022-07-12 19:21:53,689 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 19:21:53,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 71 SyntacticMatches, 9 SemanticMatches, 91 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=496, Invalid=5255, Unknown=17, NotChecked=2788, Total=8556 [2022-07-12 19:21:53,691 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 226 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 730 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:53,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 874 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1221 Invalid, 0 Unknown, 730 Unchecked, 0.5s Time] [2022-07-12 19:21:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 19:21:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2022-07-12 19:21:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-07-12 19:21:53,693 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 55 [2022-07-12 19:21:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:53,693 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-07-12 19:21:53,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.123076923076923) internal successors, (138), 65 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-07-12 19:21:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 19:21:53,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:53,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:53,711 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-12 19:21:53,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:53,913 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:53,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341834, now seen corresponding path program 1 times [2022-07-12 19:21:53,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:53,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840743425] [2022-07-12 19:21:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 19:21:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:53,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840743425] [2022-07-12 19:21:53,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840743425] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:53,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324389997] [2022-07-12 19:21:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:53,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:53,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:53,968 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-12 19:21:53,970 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-12 19:21:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:54,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:21:54,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 19:21:54,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:21:54,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324389997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:54,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:21:54,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2022-07-12 19:21:54,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161857152] [2022-07-12 19:21:54,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:54,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:21:54,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:54,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:21:54,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:21:54,154 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:54,232 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-07-12 19:21:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:21:54,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-12 19:21:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:54,233 INFO L225 Difference]: With dead ends: 82 [2022-07-12 19:21:54,233 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 19:21:54,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:21:54,233 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 144 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:54,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 107 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:21:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 19:21:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-07-12 19:21:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-07-12 19:21:54,236 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 59 [2022-07-12 19:21:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:54,236 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-07-12 19:21:54,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-07-12 19:21:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 19:21:54,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:54,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:54,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 19:21:54,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 19:21:54,444 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341833, now seen corresponding path program 1 times [2022-07-12 19:21:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:54,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709371753] [2022-07-12 19:21:54,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:54,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 19:21:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:54,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709371753] [2022-07-12 19:21:54,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709371753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:54,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:54,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:21:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366241850] [2022-07-12 19:21:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:54,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:21:54,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:54,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:21:54,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:21:54,545 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:54,697 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-12 19:21:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:21:54,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-12 19:21:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:54,698 INFO L225 Difference]: With dead ends: 80 [2022-07-12 19:21:54,698 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 19:21:54,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:21:54,699 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:54,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 52 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:21:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 19:21:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-07-12 19:21:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 73 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-07-12 19:21:54,701 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 59 [2022-07-12 19:21:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:54,701 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-07-12 19:21:54,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-07-12 19:21:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 19:21:54,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:54,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:54,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 19:21:54,702 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1658827190, now seen corresponding path program 1 times [2022-07-12 19:21:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:54,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286569336] [2022-07-12 19:21:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 19:21:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:54,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286569336] [2022-07-12 19:21:54,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286569336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:54,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:54,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:21:54,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110121145] [2022-07-12 19:21:54,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:54,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:21:54,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:54,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:21:54,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:21:54,772 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:54,873 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-07-12 19:21:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:21:54,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-12 19:21:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:54,874 INFO L225 Difference]: With dead ends: 77 [2022-07-12 19:21:54,874 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 19:21:54,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:21:54,875 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 265 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:54,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 81 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 19:21:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-07-12 19:21:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2022-07-12 19:21:54,877 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 60 [2022-07-12 19:21:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:54,877 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2022-07-12 19:21:54,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-07-12 19:21:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 19:21:54,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:54,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:54,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 19:21:54,877 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:54,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -698613301, now seen corresponding path program 1 times [2022-07-12 19:21:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:54,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880579682] [2022-07-12 19:21:54,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:54,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 19:21:54,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:54,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880579682] [2022-07-12 19:21:54,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880579682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:54,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:54,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:21:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207037847] [2022-07-12 19:21:54,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:54,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:21:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:54,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:21:54,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:21:54,936 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:55,051 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-07-12 19:21:55,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:21:55,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-12 19:21:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:55,052 INFO L225 Difference]: With dead ends: 75 [2022-07-12 19:21:55,052 INFO L226 Difference]: Without dead ends: 75 [2022-07-12 19:21:55,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:21:55,052 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:55,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 65 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:21:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-12 19:21:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-12 19:21:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-12 19:21:55,053 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 62 [2022-07-12 19:21:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:55,054 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-12 19:21:55,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-12 19:21:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 19:21:55,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:55,054 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:55,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 19:21:55,054 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:21:55,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:55,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827867, now seen corresponding path program 1 times [2022-07-12 19:21:55,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:55,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456387128] [2022-07-12 19:21:55,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:55,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:21:55,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:55,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456387128] [2022-07-12 19:21:55,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456387128] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:55,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019948708] [2022-07-12 19:21:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:55,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:55,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:55,393 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:21:55,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 19:21:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:55,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-12 19:21:55,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:55,555 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-12 19:21:55,581 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:21:55,581 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-12 19:21:55,597 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 13 treesize of output 9 [2022-07-12 19:21:55,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:21:55,662 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 20 treesize of output 19 [2022-07-12 19:21:55,741 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:21:55,742 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-12 19:21:55,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:55,839 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 27 treesize of output 23 [2022-07-12 19:21:55,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:21:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 19:21:55,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:56,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:56,068 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 31 treesize of output 35 [2022-07-12 19:21:56,079 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_7 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_7) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2036 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_~head#1.base|))) is different from false [2022-07-12 19:21:56,096 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_7 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_7) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2036 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|))) is different from false [2022-07-12 19:21:56,101 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2036 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_prenex_7 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_prenex_7) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2022-07-12 19:21:56,109 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2036 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_prenex_7 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_prenex_7) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-07-12 19:21:56,121 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2035)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2035)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_prenex_7)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-07-12 19:21:56,137 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_prenex_7)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2022-07-12 19:21:56,150 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_prenex_7)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|)))) is different from false [2022-07-12 19:21:56,162 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_prenex_7)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|)))) is different from false [2022-07-12 19:21:56,190 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_prenex_7)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|)))) is different from false [2022-07-12 19:21:56,197 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:56,197 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 2 case distinctions, treesize of input 38 treesize of output 38 [2022-07-12 19:21:56,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:56,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:21:56,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:56,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 26 treesize of output 30 [2022-07-12 19:21:56,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:21:56,208 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 35 treesize of output 35 [2022-07-12 19:21:56,211 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 20 treesize of output 18 [2022-07-12 19:21:56,223 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-12 19:21:56,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2022-07-12 19:21:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-07-12 19:21:56,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019948708] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:56,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:56,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 48 [2022-07-12 19:21:56,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038175650] [2022-07-12 19:21:56,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:56,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 19:21:56,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:56,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 19:21:56,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1461, Unknown=9, NotChecked=756, Total=2352 [2022-07-12 19:21:56,320 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 49 states, 48 states have (on average 2.5625) internal successors, (123), 49 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:56,556 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_prenex_7)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2022-07-12 19:21:58,558 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_prenex_7)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-12 19:22:00,561 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_prenex_7)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-12 19:22:00,578 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_prenex_7)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|)))) is different from false [2022-07-12 19:22:00,595 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_prenex_7)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2022-07-12 19:22:00,691 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_prenex_7 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_prenex_7)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2022-07-12 19:22:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:01,105 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-07-12 19:22:01,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 19:22:01,106 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.5625) internal successors, (123), 49 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-12 19:22:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:01,106 INFO L225 Difference]: With dead ends: 89 [2022-07-12 19:22:01,106 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 19:22:01,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=343, Invalid=2894, Unknown=15, NotChecked=1860, Total=5112 [2022-07-12 19:22:01,108 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 223 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 648 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:01,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 627 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 883 Invalid, 0 Unknown, 648 Unchecked, 0.3s Time] [2022-07-12 19:22:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 19:22:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-07-12 19:22:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-07-12 19:22:01,110 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2022-07-12 19:22:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:01,110 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-07-12 19:22:01,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.5625) internal successors, (123), 49 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-07-12 19:22:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 19:22:01,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:01,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:01,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:01,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:01,323 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:22:01,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827868, now seen corresponding path program 1 times [2022-07-12 19:22:01,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:01,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143665669] [2022-07-12 19:22:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:01,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:22:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143665669] [2022-07-12 19:22:02,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143665669] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289700824] [2022-07-12 19:22:02,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:02,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:02,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:02,160 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:22:02,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 19:22:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:02,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 106 conjunts are in the unsatisfiable core [2022-07-12 19:22:02,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:02,313 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-12 19:22:02,481 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:22:02,482 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-12 19:22:02,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:22:02,609 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 13 treesize of output 9 [2022-07-12 19:22:02,614 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-12 19:22:02,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:02,846 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 19 treesize of output 18 [2022-07-12 19:22:02,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:02,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-12 19:22:03,025 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:03,026 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 42 treesize of output 41 [2022-07-12 19:22:03,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:03,029 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 20 treesize of output 22 [2022-07-12 19:22:03,283 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:03,283 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 17 treesize of output 17 [2022-07-12 19:22:03,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:03,288 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 27 treesize of output 23 [2022-07-12 19:22:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 19:22:03,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:03,737 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2022-07-12 19:22:03,746 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-07-12 19:22:03,751 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-07-12 19:22:03,760 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2022-07-12 19:22:03,782 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2151)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2150)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2150)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) is different from false [2022-07-12 19:22:03,802 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|)))) is different from false [2022-07-12 19:22:03,817 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|)))) is different from false [2022-07-12 19:22:03,837 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))))))) is different from false [2022-07-12 19:22:03,871 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|)))) is different from false [2022-07-12 19:22:03,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:03,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:03,884 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 81 [2022-07-12 19:22:03,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:03,889 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 2 case distinctions, treesize of input 62 treesize of output 60 [2022-07-12 19:22:03,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:03,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:03,897 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:03,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 36 treesize of output 40 [2022-07-12 19:22:03,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:03,904 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 54 treesize of output 54 [2022-07-12 19:22:03,911 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:03,911 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 84 treesize of output 80 [2022-07-12 19:22:03,914 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 66 treesize of output 62 [2022-07-12 19:22:03,917 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 32 treesize of output 28 [2022-07-12 19:22:03,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:03,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:03,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2022-07-12 19:22:03,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-07-12 19:22:03,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:03,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:03,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:03,953 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2022-07-12 19:22:12,290 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 27 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:22:20,628 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 50 treesize of output 46 [2022-07-12 19:22:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-07-12 19:22:20,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289700824] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:20,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:20,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25, 24] total 76 [2022-07-12 19:22:20,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15001934] [2022-07-12 19:22:20,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:20,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-07-12 19:22:20,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:20,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-07-12 19:22:20,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=4311, Unknown=9, NotChecked=1260, Total=5852 [2022-07-12 19:22:20,693 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 77 states, 76 states have (on average 2.3289473684210527) internal successors, (177), 77 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:21,266 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))))) (<= (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| .cse3)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-07-12 19:22:23,269 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) 0) (<= 8 (select |c_#length| .cse2)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2022-07-12 19:22:25,272 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))))) (not (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) 0) (<= 8 (select |c_#length| .cse2)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2022-07-12 19:22:25,303 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse2)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 8 (select |c_#length| .cse2)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))))) is different from false [2022-07-12 19:22:25,330 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (<= 8 (select |c_#length| .cse4))) (.cse0 (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4))) (and (not .cse0) .cse1 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse2 (select .cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse2 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse2 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (or .cse1 .cse0)))) is different from false [2022-07-12 19:22:25,572 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))))) (<= (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| .cse3)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-07-12 19:22:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:26,858 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-07-12 19:22:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 19:22:26,859 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.3289473684210527) internal successors, (177), 77 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-12 19:22:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:26,859 INFO L225 Difference]: With dead ends: 90 [2022-07-12 19:22:26,859 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 19:22:26,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=806, Invalid=8167, Unknown=17, NotChecked=3000, Total=11990 [2022-07-12 19:22:26,860 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 289 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:26,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 803 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1372 Invalid, 0 Unknown, 716 Unchecked, 0.6s Time] [2022-07-12 19:22:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 19:22:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2022-07-12 19:22:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-07-12 19:22:26,862 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 65 [2022-07-12 19:22:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:26,862 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-07-12 19:22:26,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.3289473684210527) internal successors, (177), 77 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-07-12 19:22:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 19:22:26,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:26,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:26,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:27,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:27,075 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:22:27,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1642891397, now seen corresponding path program 1 times [2022-07-12 19:22:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:27,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187555492] [2022-07-12 19:22:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:22:27,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:27,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187555492] [2022-07-12 19:22:27,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187555492] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:27,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489348424] [2022-07-12 19:22:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:27,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:27,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:27,702 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:22:27,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 19:22:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:27,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-12 19:22:27,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:28,186 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 13 treesize of output 9 [2022-07-12 19:22:28,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:28,487 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 54 treesize of output 41 [2022-07-12 19:22:28,788 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:22:28,788 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 55 treesize of output 56 [2022-07-12 19:22:28,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:28,804 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-12 19:22:29,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:29,181 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 70 treesize of output 58 [2022-07-12 19:22:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:22:29,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:30,379 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_42| v_ArrVal_2266))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2268)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (not (<= 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|))) (= (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-07-12 19:22:30,391 WARN L833 $PredicateComparison]: unable to prove that (or (= (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_21| Int)) (or (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_42| v_ArrVal_2266))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 (+ |v_ULTIMATE.start_main_~s~0#1.offset_21| 4)) v_ArrVal_2268)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (not (<= 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)) (not (<= |v_ULTIMATE.start_main_~s~0#1.offset_21| |c_ULTIMATE.start_sll_create_#res#1.offset|)) (< |v_ULTIMATE.start_main_~s~0#1.offset_21| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)))) is different from false [2022-07-12 19:22:30,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:30,681 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 2 case distinctions, treesize of input 38 treesize of output 38 [2022-07-12 19:22:30,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:30,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:30,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:30,699 INFO L356 Elim1Store]: treesize reduction 22, result has 60.7 percent of original size [2022-07-12 19:22:30,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 74 [2022-07-12 19:22:30,718 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-07-12 19:22:30,718 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 88 [2022-07-12 19:22:30,724 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 58 treesize of output 54 [2022-07-12 19:22:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2022-07-12 19:22:31,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489348424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:31,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:31,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 25] total 79 [2022-07-12 19:22:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354410800] [2022-07-12 19:22:31,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:31,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-07-12 19:22:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:31,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-07-12 19:22:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=5456, Unknown=106, NotChecked=302, Total=6162 [2022-07-12 19:22:31,411 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 79 states, 79 states have (on average 2.2911392405063293) internal successors, (181), 79 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:34,415 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-07-12 19:22:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-12 19:22:34,415 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.2911392405063293) internal successors, (181), 79 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-07-12 19:22:34,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:34,416 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:22:34,416 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:22:34,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 117 ConstructedPredicates, 2 IntricatePredicates, 4 DeprecatedPredicates, 2597 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=786, Invalid=12650, Unknown=144, NotChecked=462, Total=14042 [2022-07-12 19:22:34,417 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 82 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:34,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 881 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 175 Unchecked, 0.0s Time] [2022-07-12 19:22:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:22:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2022-07-12 19:22:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.08) internal successors, (81), 79 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2022-07-12 19:22:34,419 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 66 [2022-07-12 19:22:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:34,419 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2022-07-12 19:22:34,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.2911392405063293) internal successors, (181), 79 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-07-12 19:22:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 19:22:34,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:34,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:34,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:34,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:34,639 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:22:34,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:34,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1727882938, now seen corresponding path program 1 times [2022-07-12 19:22:34,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:34,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348945842] [2022-07-12 19:22:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:22:35,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:35,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348945842] [2022-07-12 19:22:35,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348945842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:35,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022698753] [2022-07-12 19:22:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:35,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:35,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:35,256 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:22:35,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 19:22:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:35,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 19:22:35,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:35,414 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-12 19:22:35,526 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:22:35,526 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-12 19:22:35,621 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 13 treesize of output 9 [2022-07-12 19:22:35,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:35,820 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-12 19:22:35,964 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:35,964 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 26 treesize of output 27 [2022-07-12 19:22:36,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:36,085 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 25 treesize of output 21 [2022-07-12 19:22:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 19:22:36,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:36,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:22:36,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:22:36,342 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:22:36,347 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:22:36,367 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (v_ArrVal_2381 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2379)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:22:36,376 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-07-12 19:22:36,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-07-12 19:22:36,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-07-12 19:22:36,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-07-12 19:22:36,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:36,427 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 2 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 19:22:36,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:36,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:36,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:36,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 29 [2022-07-12 19:22:36,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:36,440 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 32 treesize of output 32 [2022-07-12 19:22:36,443 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 9 treesize of output 7 [2022-07-12 19:22:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-07-12 19:22:36,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022698753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:36,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:36,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22, 23] total 64 [2022-07-12 19:22:36,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763148067] [2022-07-12 19:22:36,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:36,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-12 19:22:36,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:36,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-12 19:22:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2876, Unknown=9, NotChecked=1044, Total=4160 [2022-07-12 19:22:36,703 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 65 states, 64 states have (on average 2.5625) internal successors, (164), 65 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:37,313 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0)) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (< |c_ULTIMATE.start_node_create_#res#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_ULTIMATE.start_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-07-12 19:22:37,317 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (< |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_#StackHeapBarrier|) (< .cse0 |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= (+ (select .cse2 4) 1) |c_#StackHeapBarrier|)))) is different from false [2022-07-12 19:22:37,319 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (< .cse0 |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= (+ (select .cse2 4) 1) |c_#StackHeapBarrier|)))) is different from false [2022-07-12 19:22:37,359 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (<= (+ 1 .cse1) |c_#StackHeapBarrier|) (< .cse1 |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:22:37,364 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (< .cse0 |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:22:37,603 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0)) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (< |c_ULTIMATE.start_node_create_#res#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_ULTIMATE.start_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-07-12 19:22:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:38,366 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2022-07-12 19:22:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 19:22:38,367 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.5625) internal successors, (164), 65 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-07-12 19:22:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:38,368 INFO L225 Difference]: With dead ends: 88 [2022-07-12 19:22:38,368 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 19:22:38,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=660, Invalid=5863, Unknown=17, NotChecked=2580, Total=9120 [2022-07-12 19:22:38,369 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 241 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 786 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:38,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 832 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1163 Invalid, 0 Unknown, 786 Unchecked, 0.5s Time] [2022-07-12 19:22:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 19:22:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2022-07-12 19:22:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-07-12 19:22:38,371 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 68 [2022-07-12 19:22:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:38,372 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-07-12 19:22:38,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.5625) internal successors, (164), 65 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-07-12 19:22:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 19:22:38,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:38,372 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:38,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:38,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:38,590 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:22:38,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:38,590 INFO L85 PathProgramCache]: Analyzing trace with hash -177401856, now seen corresponding path program 2 times [2022-07-12 19:22:38,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:38,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637486672] [2022-07-12 19:22:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:38,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:22:39,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:39,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637486672] [2022-07-12 19:22:39,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637486672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:39,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575006027] [2022-07-12 19:22:39,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:22:39,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:39,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:39,283 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:22:39,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 19:22:39,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:22:39,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:22:39,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-12 19:22:39,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:39,512 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-12 19:22:39,515 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-12 19:22:39,561 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:22:39,561 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-12 19:22:39,599 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-12 19:22:39,604 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-12 19:22:39,611 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-12 19:22:39,620 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-12 19:22:39,701 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 19 treesize of output 18 [2022-07-12 19:22:39,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:22:39,913 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 19:22:39,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-07-12 19:22:39,928 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-12 19:22:39,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 43 [2022-07-12 19:22:40,355 INFO L356 Elim1Store]: treesize reduction 106, result has 45.6 percent of original size [2022-07-12 19:22:40,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 154 [2022-07-12 19:22:40,439 INFO L356 Elim1Store]: treesize reduction 98, result has 49.7 percent of original size [2022-07-12 19:22:40,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 237 [2022-07-12 19:22:43,091 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-12 19:22:43,091 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 57 treesize of output 38 [2022-07-12 19:22:43,098 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:43,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 19:22:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:22:43,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:23:05,896 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:23:26,088 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:23:28,121 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse4 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (< (select .cse4 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (select .cse8 4))) (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| .cse4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse8))) (store .cse7 .cse6 (store (select .cse7 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) 4) 0))))))) is different from false [2022-07-12 19:23:30,140 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse2 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (= (select (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (select .cse4 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse4))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) 4) 0) (< (select .cse2 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse5 (let ((.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse8)) (.cse7 (select .cse8 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))))) is different from false [2022-07-12 19:23:32,159 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse4 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (< (select .cse4 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= 0 (select (let ((.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (select .cse8 4))) (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse8))) (store .cse7 .cse6 (store (select .cse7 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))) 4)))))))) is different from false [2022-07-12 19:23:34,214 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse0 (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse4 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (< (select .cse4 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (select .cse8 4))) (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse8))) (store .cse7 .cse6 (store (select .cse7 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) 4) 0)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|)))) is different from false [2022-07-12 19:23:36,259 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (or (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse1 (let ((.cse4 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))))) (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse5 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse9 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse7 (select .cse9 4))) (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) 4) 0)))))))))) is different from false [2022-07-12 19:23:38,302 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (or (= (select (let ((.cse0 (let ((.cse3 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0) (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse4 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))))))) (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse5 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse9 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse7 (select .cse9 4))) (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| .cse5))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_#res#1.base|) 4)))) 4) 0)))))))))) is different from false [2022-07-12 19:23:40,339 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse5 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse2 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse5 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (= (select (let ((.cse4 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (select .cse4 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse4))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)))) 4) 0) (< (select .cse2 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))))))))) (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse6 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (or (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse6 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse7 (let ((.cse10 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (.cse9 (select .cse10 4))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))))))))) is different from false [2022-07-12 19:23:40,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:23:40,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:23:40,397 INFO L356 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-07-12 19:23:40,397 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 147 [2022-07-12 19:23:40,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:23:40,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:23:40,440 INFO L356 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-07-12 19:23:40,440 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 124 [2022-07-12 19:23:40,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:23:40,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:23:40,754 INFO L356 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-07-12 19:23:40,755 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 124 [2022-07-12 19:23:40,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:23:40,761 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 22 treesize of output 20 [2022-07-12 19:23:40,870 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse0 (< 0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (.cse32 (not .cse12))) (and (or .cse0 (and (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse3 (select v_arrayElimArr_14 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)) (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (= (select (let ((.cse4 (let ((.cse6 (select v_arrayElimArr_14 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse7 (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (or (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (not (= (select v_arrayElimArr_14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse8 (let ((.cse10 (select v_arrayElimArr_14 4))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse11 (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) .cse12) (or (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (not (= (select v_arrayElimArr_14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse15 (select v_arrayElimArr_14 4))) (store .cse14 .cse15 (store (select .cse14 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse12) (or .cse12 (and (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse17 (select v_arrayElimArr_13 4))) (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse16 .cse17 (store (select .cse16 .cse17) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse18 .cse17 (store (select .cse18 .cse17) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) .cse0) (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse20 (select v_arrayElimArr_13 4))) (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse19 .cse20 (store (select .cse19 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse21 .cse20 (store (select .cse21 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) .cse0) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse23 (select v_arrayElimArr_13 4))) (select (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse22 .cse23 (store (select .cse22 .cse23) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse24 .cse23 (store (select .cse24 .cse23) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (not (<= (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))))) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (= (select (let ((.cse25 (let ((.cse27 (select v_arrayElimArr_14 4))) (store .cse26 .cse27 (store (select .cse26 .cse27) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse28 (store .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse29 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (or (not (= (select v_arrayElimArr_13 .cse29) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_12 .cse29)) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (let ((.cse30 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse32) (or .cse0 (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (let ((.cse34 (select v_arrayElimArr_13 4))) (select (store .cse33 .cse34 (store (select .cse33 .cse34) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse35 .cse34 (store (select .cse35 .cse34) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (let ((.cse37 (select v_arrayElimArr_13 4))) (select (store .cse36 .cse37 (store (select .cse36 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse38 .cse37 (store (select .cse38 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (<= (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse40 (select v_arrayElimArr_13 4))) (select (store .cse39 .cse40 (store (select .cse39 .cse40) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse41 .cse40 (store (select .cse41 .cse40) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse0) (or .cse32 (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_148 Int)) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (select (store .cse42 v_arrayElimCell_148 (store (select .cse42 v_arrayElimCell_148) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse43 v_arrayElimCell_148 (store (select .cse43 v_arrayElimCell_148) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (<= (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))))))))) is different from false [2022-07-12 19:23:42,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:42,944 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 79 treesize of output 70 [2022-07-12 19:23:42,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:42,949 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 59 treesize of output 50 [2022-07-12 19:23:42,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:23:42,959 INFO L356 Elim1Store]: treesize reduction 22, result has 15.4 percent of original size [2022-07-12 19:23:42,959 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 432 treesize of output 386 [2022-07-12 19:23:42,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:23:42,965 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 160 treesize of output 154 [2022-07-12 19:23:42,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:42,985 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 58 treesize of output 60 [2022-07-12 19:23:42,989 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 52 treesize of output 46 [2022-07-12 19:23:42,992 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 11 treesize of output 7 [2022-07-12 19:23:43,016 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:43,017 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 87 treesize of output 58 [2022-07-12 19:23:43,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:23:43,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2022-07-12 19:23:43,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:43,038 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 58 treesize of output 60 [2022-07-12 19:23:43,042 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 52 treesize of output 46 [2022-07-12 19:23:43,071 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:43,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2022-07-12 19:23:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-07-12 19:23:43,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575006027] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:23:43,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:23:43,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 31] total 72 [2022-07-12 19:23:43,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464301602] [2022-07-12 19:23:43,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:23:43,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-12 19:23:43,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:23:43,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-12 19:23:43,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3802, Unknown=22, NotChecked=1048, Total=5112 [2022-07-12 19:23:43,109 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 72 states, 72 states have (on average 2.3333333333333335) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:23:43,429 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse29 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse0 (< 0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (.cse33 (not .cse12))) (and (or .cse0 (and (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse3 (select v_arrayElimArr_14 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)) (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (= (select (let ((.cse4 (let ((.cse6 (select v_arrayElimArr_14 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse7 (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (or (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (not (= (select v_arrayElimArr_14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse8 (let ((.cse10 (select v_arrayElimArr_14 4))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse11 (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) .cse12) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (or (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (not (= (select v_arrayElimArr_14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse15 (select v_arrayElimArr_14 4))) (store .cse14 .cse15 (store (select .cse14 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse12) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or .cse12 (and (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse17 (select v_arrayElimArr_13 4))) (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse16 .cse17 (store (select .cse16 .cse17) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse18 .cse17 (store (select .cse18 .cse17) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) .cse0) (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse20 (select v_arrayElimArr_13 4))) (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse19 .cse20 (store (select .cse19 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse21 .cse20 (store (select .cse21 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) .cse0) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse23 (select v_arrayElimArr_13 4))) (select (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse22 .cse23 (store (select .cse22 .cse23) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse24 .cse23 (store (select .cse24 .cse23) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (not (<= (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))))) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (= (select (let ((.cse25 (let ((.cse27 (select v_arrayElimArr_14 4))) (store .cse26 .cse27 (store (select .cse26 .cse27) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse28 (store .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse29) 0) (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse30 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (or (not (= (select v_arrayElimArr_13 .cse30) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_12 .cse30)) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse33) (or .cse0 (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (let ((.cse35 (select v_arrayElimArr_13 4))) (select (store .cse34 .cse35 (store (select .cse34 .cse35) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse36 .cse35 (store (select .cse36 .cse35) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse34 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse34 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (let ((.cse38 (select v_arrayElimArr_13 4))) (select (store .cse37 .cse38 (store (select .cse37 .cse38) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse39 .cse38 (store (select .cse39 .cse38) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse37 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse37 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (<= (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse29) 0) .cse12 (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse40 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse41 (select v_arrayElimArr_13 4))) (select (store .cse40 .cse41 (store (select .cse40 .cse41) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse42 .cse41 (store (select .cse42 .cse41) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (or .cse33 (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_148 Int)) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse43 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (select (store .cse43 v_arrayElimCell_148 (store (select .cse43 v_arrayElimCell_148) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse44 v_arrayElimCell_148 (store (select .cse44 v_arrayElimCell_148) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (<= (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse46 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse46 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from false [2022-07-12 19:23:43,606 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse0 (< 0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (.cse32 (not .cse12))) (and (or .cse0 (and (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse3 (select v_arrayElimArr_14 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)) (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (= (select (let ((.cse4 (let ((.cse6 (select v_arrayElimArr_14 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse7 (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (or (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (not (= (select v_arrayElimArr_14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse8 (let ((.cse10 (select v_arrayElimArr_14 4))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (let ((.cse11 (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) .cse12) (or (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (not (= (select v_arrayElimArr_14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse15 (select v_arrayElimArr_14 4))) (store .cse14 .cse15 (store (select .cse14 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse12) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or .cse12 (and (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse17 (select v_arrayElimArr_13 4))) (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse16 .cse17 (store (select .cse16 .cse17) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse18 .cse17 (store (select .cse18 .cse17) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) .cse0) (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse20 (select v_arrayElimArr_13 4))) (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse19 .cse20 (store (select .cse19 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse21 .cse20 (store (select .cse21 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) .cse0) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse23 (select v_arrayElimArr_13 4))) (select (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse22 .cse23 (store (select .cse22 .cse23) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse24 .cse23 (store (select .cse24 .cse23) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (not (<= (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))))) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (= (select (let ((.cse25 (let ((.cse27 (select v_arrayElimArr_14 4))) (store .cse26 .cse27 (store (select .cse26 .cse27) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse28 (store .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse29 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (or (not (= (select v_arrayElimArr_13 .cse29) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_12 .cse29)) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (let ((.cse30 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse32) (or .cse0 (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (let ((.cse34 (select v_arrayElimArr_13 4))) (select (store .cse33 .cse34 (store (select .cse33 .cse34) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse35 .cse34 (store (select .cse35 .cse34) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (let ((.cse37 (select v_arrayElimArr_13 4))) (select (store .cse36 .cse37 (store (select .cse36 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse38 .cse37 (store (select .cse38 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (<= (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) .cse12 (or (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse40 (select v_arrayElimArr_13 4))) (select (store .cse39 .cse40 (store (select .cse39 .cse40) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse41 .cse40 (store (select .cse41 .cse40) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse0) (or .cse32 (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_148 Int)) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (select (store .cse42 v_arrayElimCell_148 (store (select .cse42 v_arrayElimCell_148) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse43 v_arrayElimCell_148 (store (select .cse43 v_arrayElimCell_148) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (<= (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2506 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from false [2022-07-12 19:23:47,608 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse5 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse2 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse5 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (= (select (let ((.cse4 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (select .cse4 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse4))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)))) 4) 0) (< (select .cse2 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))))))))) (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse6 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (or (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse6 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse7 (let ((.cse10 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (.cse9 (select .cse10 4))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) is different from false [2022-07-12 19:23:49,614 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (or (= (select (let ((.cse0 (let ((.cse3 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0) (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse4 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse5 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse9 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse7 (select .cse9 4))) (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| .cse5))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_#res#1.base|) 4)))) 4) 0))))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) is different from false [2022-07-12 19:23:51,621 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (or (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse1 (let ((.cse4 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2498 Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse5 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse9 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse7 (select .cse9 4))) (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) 4) 0))))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) is different from false [2022-07-12 19:23:53,626 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (and (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse1 (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))) (= (select (select |c_#memory_$Pointer$.base| .cse5) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse6 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (< (select .cse6 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse10 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse8 (select .cse10 4))) (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse6))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse10))) (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) 4) 0)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0)))) is different from false [2022-07-12 19:23:55,631 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse0 (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))))) (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse5 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= 0 (select (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse7 (select .cse9 4))) (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse5))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))) 4))))))) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0) (not (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-07-12 19:23:57,636 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (= (select (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse2 (select .cse5 4))) (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse5))) (store .cse4 .cse2 (store (select .cse4 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) 4) 0) (< (select .cse3 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse6 (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse9)) (.cse8 (select .cse9 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))))))) is different from false [2022-07-12 19:23:59,640 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse1 (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse0) 4)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse5 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502))) (or (< (select .cse5 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse7 (select .cse9 4))) (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| .cse5))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse9))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) 4) 0)))))))) is different from false [2022-07-12 19:24:01,472 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse1 (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) 4) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse0) 4)) .cse1 (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| .cse0) (or (and (forall ((v_ArrVal_2507 Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2502))) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (or (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2503)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse5))) (select (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507)) (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) 4) 0) (< (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse5) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))) (forall ((v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (or (= (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2503)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) .cse9))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2502)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse9) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))))) (not .cse1)))) is different from false [2022-07-12 19:24:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:24:02,151 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-07-12 19:24:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 19:24:02,152 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.3333333333333335) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-12 19:24:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:24:02,152 INFO L225 Difference]: With dead ends: 142 [2022-07-12 19:24:02,152 INFO L226 Difference]: Without dead ends: 142 [2022-07-12 19:24:02,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 78.9s TimeCoverageRelationStatistics Valid=397, Invalid=5649, Unknown=32, NotChecked=3042, Total=9120 [2022-07-12 19:24:02,153 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 93 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 635 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:24:02,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1173 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 760 Invalid, 0 Unknown, 635 Unchecked, 0.3s Time] [2022-07-12 19:24:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-12 19:24:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2022-07-12 19:24:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0522388059701493) internal successors, (141), 138 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:24:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2022-07-12 19:24:02,155 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 71 [2022-07-12 19:24:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:24:02,156 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2022-07-12 19:24:02,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.3333333333333335) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:24:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2022-07-12 19:24:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 19:24:02,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:24:02,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:24:02,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-12 19:24:02,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-12 19:24:02,363 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 19:24:02,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:24:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1204491648, now seen corresponding path program 2 times [2022-07-12 19:24:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:24:02,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548660710] [2022-07-12 19:24:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:24:02,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:24:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:24:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:24:03,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:24:03,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548660710] [2022-07-12 19:24:03,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548660710] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:24:03,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876697897] [2022-07-12 19:24:03,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:24:03,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:24:03,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:24:03,685 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:24:03,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 19:24:03,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:24:03,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:24:03,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-12 19:24:03,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:24:04,302 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-12 19:24:04,642 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 19:24:04,642 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 46 treesize of output 41 [2022-07-12 19:24:05,099 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:24:05,100 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 75 treesize of output 78 [2022-07-12 19:24:05,125 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-07-12 19:24:05,125 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 64 treesize of output 58 [2022-07-12 19:24:05,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:24:05,585 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 73 treesize of output 65 [2022-07-12 19:24:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:24:06,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:24:06,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 4) v_ArrVal_2624)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-12 19:24:06,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 4) v_ArrVal_2624)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-12 19:24:06,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (select .cse0 4) v_ArrVal_2624)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-12 19:24:06,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (select .cse0 4) v_ArrVal_2624)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0)))) is different from false [2022-07-12 19:24:06,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:24:06,891 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 2 case distinctions, treesize of input 45 treesize of output 45 [2022-07-12 19:24:06,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:24:06,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:24:06,915 INFO L356 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2022-07-12 19:24:06,916 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 3 case distinctions, treesize of input 70 treesize of output 92 [2022-07-12 19:24:06,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:24:06,923 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 128 treesize of output 120 [2022-07-12 19:24:06,926 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 90 treesize of output 86