./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f4b24e32 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-ext3-properties/sll_of_sll_nondet_append-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:51:33,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:51:33,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:51:33,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:51:33,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:51:33,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:51:33,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:51:33,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:51:33,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:51:33,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:51:33,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:51:33,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:51:33,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:51:33,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:51:33,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:51:33,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:51:33,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:51:33,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:51:33,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:51:33,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:51:33,362 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:51:33,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:51:33,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:51:33,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:51:33,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:51:33,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:51:33,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:51:33,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:51:33,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:51:33,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:51:33,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:51:33,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:51:33,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:51:33,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:51:33,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:51:33,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:51:33,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:51:33,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:51:33,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:51:33,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:51:33,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:51:33,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:51:33,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-14 05:51:33,404 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:51:33,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:51:33,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:51:33,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:51:33,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:51:33,405 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:51:33,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:51:33,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:51:33,406 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:51:33,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:51:33,406 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:51:33,407 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:51:33,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:51:33,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:51:33,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:51:33,407 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:51:33,407 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:51:33,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:51:33,408 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:51:33,408 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:51:33,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:51:33,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:51:33,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:51:33,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:51:33,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:51:33,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:51:33,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:51:33,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:51:33,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:51:33,409 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-memcleanup) ) 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 -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2022-07-14 05:51:33,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:51:33,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:51:33,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:51:33,655 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:51:33,655 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:51:33,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-07-14 05:51:33,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89c49cf5/3d583847a39f4b9980311d2559d95c2e/FLAG3b8e188b2 [2022-07-14 05:51:34,127 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:51:34,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-07-14 05:51:34,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89c49cf5/3d583847a39f4b9980311d2559d95c2e/FLAG3b8e188b2 [2022-07-14 05:51:34,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89c49cf5/3d583847a39f4b9980311d2559d95c2e [2022-07-14 05:51:34,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:51:34,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:51:34,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:51:34,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:51:34,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:51:34,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56704311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34, skipping insertion in model container [2022-07-14 05:51:34,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:51:34,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:51:34,413 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-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-07-14 05:51:34,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:51:34,425 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:51:34,469 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-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-07-14 05:51:34,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:51:34,489 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:51:34,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34 WrapperNode [2022-07-14 05:51:34,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:51:34,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:51:34,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:51:34,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:51:34,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,541 INFO L137 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-07-14 05:51:34,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:51:34,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:51:34,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:51:34,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:51:34,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:51:34,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:51:34,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:51:34,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:51:34,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (1/1) ... [2022-07-14 05:51:34,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:51:34,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:34,605 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-14 05:51:34,606 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-14 05:51:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-14 05:51:34,630 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-14 05:51:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:51:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:51:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 05:51:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:51:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2022-07-14 05:51:34,630 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2022-07-14 05:51:34,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:51:34,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:51:34,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 05:51:34,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 05:51:34,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:51:34,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:51:34,742 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:51:34,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:51:34,774 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-14 05:51:34,994 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:51:34,999 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:51:35,002 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-14 05:51:35,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:51:35 BoogieIcfgContainer [2022-07-14 05:51:35,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:51:35,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:51:35,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:51:35,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:51:35,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:51:34" (1/3) ... [2022-07-14 05:51:35,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c7e115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:51:35, skipping insertion in model container [2022-07-14 05:51:35,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:51:34" (2/3) ... [2022-07-14 05:51:35,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c7e115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:51:35, skipping insertion in model container [2022-07-14 05:51:35,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:51:35" (3/3) ... [2022-07-14 05:51:35,011 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2022-07-14 05:51:35,020 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:51:35,021 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-07-14 05:51:35,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:51:35,074 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@221b13a3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7955147b [2022-07-14 05:51:35,074 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-07-14 05:51:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 116 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 05:51:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:51:35,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:35,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:35,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:35,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:35,093 INFO L85 PathProgramCache]: Analyzing trace with hash -46006015, now seen corresponding path program 1 times [2022-07-14 05:51:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:35,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511876533] [2022-07-14 05:51:35,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:35,249 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-14 05:51:35,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:35,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511876533] [2022-07-14 05:51:35,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511876533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:35,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:35,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:51:35,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257879948] [2022-07-14 05:51:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:35,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:51:35,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:35,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:51:35,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:51:35,284 INFO L87 Difference]: Start difference. First operand has 121 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 116 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:35,346 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-07-14 05:51:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:51:35,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 05:51:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:35,355 INFO L225 Difference]: With dead ends: 128 [2022-07-14 05:51:35,357 INFO L226 Difference]: Without dead ends: 122 [2022-07-14 05:51:35,367 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-14 05:51:35,369 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:35,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 258 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-14 05:51:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2022-07-14 05:51:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 112 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 05:51:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2022-07-14 05:51:35,418 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 10 [2022-07-14 05:51:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:35,418 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2022-07-14 05:51:35,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2022-07-14 05:51:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 05:51:35,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:35,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:35,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 05:51:35,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash 244152622, now seen corresponding path program 1 times [2022-07-14 05:51:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:35,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053590473] [2022-07-14 05:51:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:35,472 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-14 05:51:35,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:35,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053590473] [2022-07-14 05:51:35,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053590473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:35,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:35,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:51:35,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138988449] [2022-07-14 05:51:35,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:35,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:51:35,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:35,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:51:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:51:35,476 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:35,573 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-07-14 05:51:35,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:51:35,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 05:51:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:35,576 INFO L225 Difference]: With dead ends: 151 [2022-07-14 05:51:35,576 INFO L226 Difference]: Without dead ends: 151 [2022-07-14 05:51:35,576 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-14 05:51:35,577 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:35,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 234 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:51:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-14 05:51:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2022-07-14 05:51:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 111 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 05:51:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-07-14 05:51:35,584 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 13 [2022-07-14 05:51:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:35,585 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-07-14 05:51:35,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-07-14 05:51:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 05:51:35,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:35,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:35,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 05:51:35,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:35,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:35,587 INFO L85 PathProgramCache]: Analyzing trace with hash 244152621, now seen corresponding path program 1 times [2022-07-14 05:51:35,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:35,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539191062] [2022-07-14 05:51:35,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:35,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:35,635 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-14 05:51:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:35,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539191062] [2022-07-14 05:51:35,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539191062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:35,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:35,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:51:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21411314] [2022-07-14 05:51:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:35,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:51:35,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:35,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:51:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:51:35,637 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:35,712 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-07-14 05:51:35,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:51:35,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 05:51:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:35,715 INFO L225 Difference]: With dead ends: 150 [2022-07-14 05:51:35,716 INFO L226 Difference]: Without dead ends: 150 [2022-07-14 05:51:35,716 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-14 05:51:35,717 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:35,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 228 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:51:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-14 05:51:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 114. [2022-07-14 05:51:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 110 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 05:51:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2022-07-14 05:51:35,724 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2022-07-14 05:51:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:35,725 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2022-07-14 05:51:35,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2022-07-14 05:51:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:51:35,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:35,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:35,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 05:51:35,726 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253985, now seen corresponding path program 1 times [2022-07-14 05:51:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:35,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011216585] [2022-07-14 05:51:35,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:35,754 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-14 05:51:35,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:35,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011216585] [2022-07-14 05:51:35,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011216585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:35,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:35,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:51:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090031919] [2022-07-14 05:51:35,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:35,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:51:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:35,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:51:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:51:35,757 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:35,803 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2022-07-14 05:51:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:51:35,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 05:51:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:35,804 INFO L225 Difference]: With dead ends: 112 [2022-07-14 05:51:35,804 INFO L226 Difference]: Without dead ends: 112 [2022-07-14 05:51:35,805 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-14 05:51:35,806 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:35,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 162 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-14 05:51:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-14 05:51:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.7183098591549295) internal successors, (122), 108 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 05:51:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-07-14 05:51:35,812 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2022-07-14 05:51:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:35,812 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-07-14 05:51:35,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-07-14 05:51:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:51:35,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:35,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:35,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 05:51:35,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:35,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:35,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253984, now seen corresponding path program 1 times [2022-07-14 05:51:35,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:35,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496101258] [2022-07-14 05:51:35,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:35,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:35,857 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-14 05:51:35,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:35,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496101258] [2022-07-14 05:51:35,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496101258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:35,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:35,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:51:35,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749608886] [2022-07-14 05:51:35,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:35,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:51:35,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:35,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:51:35,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:51:35,867 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:35,941 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2022-07-14 05:51:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:51:35,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 05:51:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:35,943 INFO L225 Difference]: With dead ends: 213 [2022-07-14 05:51:35,944 INFO L226 Difference]: Without dead ends: 213 [2022-07-14 05:51:35,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:51:35,945 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 160 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:35,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 889 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-14 05:51:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 139. [2022-07-14 05:51:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 134 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 05:51:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 169 transitions. [2022-07-14 05:51:35,967 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 169 transitions. Word has length 14 [2022-07-14 05:51:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:35,967 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 169 transitions. [2022-07-14 05:51:35,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 169 transitions. [2022-07-14 05:51:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 05:51:35,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:35,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:35,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 05:51:35,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:35,968 INFO L85 PathProgramCache]: Analyzing trace with hash -790832604, now seen corresponding path program 1 times [2022-07-14 05:51:35,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:35,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290520415] [2022-07-14 05:51:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:35,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:36,026 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-14 05:51:36,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:36,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290520415] [2022-07-14 05:51:36,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290520415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:36,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473235764] [2022-07-14 05:51:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:36,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:36,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:36,030 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-14 05:51:36,031 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-14 05:51:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:36,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 05:51:36,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:36,228 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-14 05:51:36,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:36,243 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-14 05:51:36,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473235764] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:36,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:51:36,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-14 05:51:36,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007354845] [2022-07-14 05:51:36,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:36,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:51:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:36,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:51:36,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:51:36,245 INFO L87 Difference]: Start difference. First operand 139 states and 169 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:36,305 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2022-07-14 05:51:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:51:36,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 05:51:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:36,306 INFO L225 Difference]: With dead ends: 192 [2022-07-14 05:51:36,306 INFO L226 Difference]: Without dead ends: 192 [2022-07-14 05:51:36,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:51:36,307 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 91 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:36,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 515 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:51:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-14 05:51:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2022-07-14 05:51:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 149 states have internal predecessors, (185), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2022-07-14 05:51:36,316 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2022-07-14 05:51:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:36,317 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2022-07-14 05:51:36,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2022-07-14 05:51:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 05:51:36,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:36,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:36,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 05:51:36,529 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-14 05:51:36,529 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash -924446423, now seen corresponding path program 1 times [2022-07-14 05:51:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:36,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453029078] [2022-07-14 05:51:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:36,589 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-14 05:51:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:36,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453029078] [2022-07-14 05:51:36,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453029078] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:36,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270213597] [2022-07-14 05:51:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:36,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:36,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:36,608 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-14 05:51:36,631 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-14 05:51:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:36,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 05:51:36,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:36,756 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-14 05:51:36,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:36,803 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-14 05:51:36,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270213597] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:36,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:51:36,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-14 05:51:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953093151] [2022-07-14 05:51:36,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:36,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 05:51:36,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 05:51:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:51:36,808 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:36,897 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2022-07-14 05:51:36,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:51:36,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 05:51:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:36,899 INFO L225 Difference]: With dead ends: 238 [2022-07-14 05:51:36,899 INFO L226 Difference]: Without dead ends: 238 [2022-07-14 05:51:36,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-07-14 05:51:36,902 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 291 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:36,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1261 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:51:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-14 05:51:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 164. [2022-07-14 05:51:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 120 states have (on average 1.6083333333333334) internal successors, (193), 157 states have internal predecessors, (193), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2022-07-14 05:51:36,919 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 18 [2022-07-14 05:51:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:36,920 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2022-07-14 05:51:36,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2022-07-14 05:51:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 05:51:36,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:36,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:36,960 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-14 05:51:37,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-14 05:51:37,127 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:37,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:37,127 INFO L85 PathProgramCache]: Analyzing trace with hash 760370116, now seen corresponding path program 2 times [2022-07-14 05:51:37,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:37,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009949086] [2022-07-14 05:51:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 05:51:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009949086] [2022-07-14 05:51:37,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009949086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:37,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:37,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:51:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477638672] [2022-07-14 05:51:37,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:37,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:51:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:37,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:51:37,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:51:37,174 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:37,210 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-07-14 05:51:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:51:37,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 05:51:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:37,211 INFO L225 Difference]: With dead ends: 182 [2022-07-14 05:51:37,211 INFO L226 Difference]: Without dead ends: 182 [2022-07-14 05:51:37,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:51:37,212 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 162 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:37,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 638 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-14 05:51:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-07-14 05:51:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.603305785123967) internal successors, (194), 158 states have internal predecessors, (194), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2022-07-14 05:51:37,216 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 26 [2022-07-14 05:51:37,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:37,216 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2022-07-14 05:51:37,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2022-07-14 05:51:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 05:51:37,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:37,217 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:37,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 05:51:37,218 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676229, now seen corresponding path program 2 times [2022-07-14 05:51:37,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:37,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288033522] [2022-07-14 05:51:37,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:37,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:51:37,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:37,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288033522] [2022-07-14 05:51:37,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288033522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:37,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096232030] [2022-07-14 05:51:37,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:51:37,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:37,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:37,327 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-14 05:51:37,329 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-14 05:51:37,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:51:37,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:51:37,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 05:51:37,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:37,418 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-14 05:51:37,424 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-14 05:51:37,471 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:51:37,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:51:37,478 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-14 05:51:37,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:37,502 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-14 05:51:37,507 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:37,507 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-14 05:51:37,527 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:51:37,527 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-14 05:51:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 05:51:37,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:51:38,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096232030] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:38,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:51:38,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2022-07-14 05:51:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685223787] [2022-07-14 05:51:38,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:38,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:51:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:51:38,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:51:38,126 INFO L87 Difference]: Start difference. First operand 165 states and 202 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:38,163 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2022-07-14 05:51:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:51:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 05:51:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:38,165 INFO L225 Difference]: With dead ends: 163 [2022-07-14 05:51:38,165 INFO L226 Difference]: Without dead ends: 163 [2022-07-14 05:51:38,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:51:38,166 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 171 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:38,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 272 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 55 Unchecked, 0.0s Time] [2022-07-14 05:51:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-14 05:51:38,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-07-14 05:51:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 121 states have (on average 1.5702479338842976) internal successors, (190), 156 states have internal predecessors, (190), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2022-07-14 05:51:38,169 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 26 [2022-07-14 05:51:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:38,170 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2022-07-14 05:51:38,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2022-07-14 05:51:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 05:51:38,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:38,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:38,187 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-14 05:51:38,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:38,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting sll_appendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash 320066679, now seen corresponding path program 1 times [2022-07-14 05:51:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:38,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176093343] [2022-07-14 05:51:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 05:51:38,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:38,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176093343] [2022-07-14 05:51:38,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176093343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:38,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:38,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:51:38,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045272348] [2022-07-14 05:51:38,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:38,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:51:38,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:38,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:51:38,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:51:38,436 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:38,497 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2022-07-14 05:51:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:51:38,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 05:51:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:38,499 INFO L225 Difference]: With dead ends: 162 [2022-07-14 05:51:38,499 INFO L226 Difference]: Without dead ends: 162 [2022-07-14 05:51:38,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:51:38,500 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 83 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:38,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 288 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:51:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-14 05:51:38,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-14 05:51:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 121 states have (on average 1.5537190082644627) internal successors, (188), 155 states have internal predecessors, (188), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2022-07-14 05:51:38,503 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 31 [2022-07-14 05:51:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:38,504 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2022-07-14 05:51:38,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2022-07-14 05:51:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 05:51:38,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:38,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:38,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 05:51:38,505 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting sll_appendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:38,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:38,505 INFO L85 PathProgramCache]: Analyzing trace with hash 320066680, now seen corresponding path program 1 times [2022-07-14 05:51:38,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:38,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959918632] [2022-07-14 05:51:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:38,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 05:51:38,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:38,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959918632] [2022-07-14 05:51:38,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959918632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:38,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:38,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:51:38,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047482573] [2022-07-14 05:51:38,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:38,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:51:38,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:38,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:51:38,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:51:38,557 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:38,616 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2022-07-14 05:51:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:51:38,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 05:51:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:38,617 INFO L225 Difference]: With dead ends: 161 [2022-07-14 05:51:38,617 INFO L226 Difference]: Without dead ends: 161 [2022-07-14 05:51:38,617 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-14 05:51:38,618 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:38,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 326 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-14 05:51:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-14 05:51:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 121 states have (on average 1.537190082644628) internal successors, (186), 154 states have internal predecessors, (186), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2022-07-14 05:51:38,621 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 31 [2022-07-14 05:51:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:38,621 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2022-07-14 05:51:38,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2022-07-14 05:51:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 05:51:38,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:38,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:38,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 05:51:38,623 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132480, now seen corresponding path program 1 times [2022-07-14 05:51:38,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:38,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39365753] [2022-07-14 05:51:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:38,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 05:51:38,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:38,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39365753] [2022-07-14 05:51:38,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39365753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:38,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416855922] [2022-07-14 05:51:38,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:38,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:38,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:38,727 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-14 05:51:38,728 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-14 05:51:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:38,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 05:51:38,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:38,813 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-14 05:51:38,836 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:51:38,837 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-14 05:51:38,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:38,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:51:38,874 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:51:38,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 05:51:38,937 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-14 05:51:38,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-07-14 05:51:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 05:51:39,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 05:51:39,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416855922] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:39,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:51:39,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2022-07-14 05:51:39,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246245125] [2022-07-14 05:51:39,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:39,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 05:51:39,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:39,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 05:51:39,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-07-14 05:51:39,251 INFO L87 Difference]: Start difference. First operand 161 states and 194 transitions. Second operand has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:39,458 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2022-07-14 05:51:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:51:39,458 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-14 05:51:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:39,459 INFO L225 Difference]: With dead ends: 222 [2022-07-14 05:51:39,459 INFO L226 Difference]: Without dead ends: 222 [2022-07-14 05:51:39,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-14 05:51:39,460 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 283 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:39,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 782 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 341 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2022-07-14 05:51:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-14 05:51:39,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2022-07-14 05:51:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 170 states have (on average 1.4764705882352942) internal successors, (251), 205 states have internal predecessors, (251), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:51:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 265 transitions. [2022-07-14 05:51:39,464 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 265 transitions. Word has length 32 [2022-07-14 05:51:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:39,464 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 265 transitions. [2022-07-14 05:51:39,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2022-07-14 05:51:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 05:51:39,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:39,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:39,485 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-14 05:51:39,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:39,666 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting sll_appendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:39,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132481, now seen corresponding path program 1 times [2022-07-14 05:51:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:39,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181129610] [2022-07-14 05:51:39,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 05:51:39,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:39,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181129610] [2022-07-14 05:51:39,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181129610] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:39,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370033614] [2022-07-14 05:51:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:39,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:39,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:39,789 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-14 05:51:39,809 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-14 05:51:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:39,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 05:51:39,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:39,894 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-14 05:51:39,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,932 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-14 05:51:39,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,947 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-14 05:51:39,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,971 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-14 05:51:39,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:39,988 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-14 05:51:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 05:51:40,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 05:51:40,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370033614] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:40,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:51:40,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-07-14 05:51:40,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541007612] [2022-07-14 05:51:40,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:40,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 05:51:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:40,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 05:51:40,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:51:40,556 INFO L87 Difference]: Start difference. First operand 213 states and 265 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:40,656 INFO L93 Difference]: Finished difference Result 219 states and 263 transitions. [2022-07-14 05:51:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:51:40,657 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-14 05:51:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:40,658 INFO L225 Difference]: With dead ends: 219 [2022-07-14 05:51:40,658 INFO L226 Difference]: Without dead ends: 219 [2022-07-14 05:51:40,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:51:40,659 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 68 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:40,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 481 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2022-07-14 05:51:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-14 05:51:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2022-07-14 05:51:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 170 states have (on average 1.4529411764705882) internal successors, (247), 204 states have internal predecessors, (247), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:51:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 261 transitions. [2022-07-14 05:51:40,665 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 261 transitions. Word has length 32 [2022-07-14 05:51:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:40,665 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 261 transitions. [2022-07-14 05:51:40,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2022-07-14 05:51:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 05:51:40,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:40,666 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:40,698 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-14 05:51:40,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-14 05:51:40,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:40,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash 60922559, now seen corresponding path program 1 times [2022-07-14 05:51:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:40,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78905080] [2022-07-14 05:51:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 05:51:41,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:41,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78905080] [2022-07-14 05:51:41,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78905080] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:41,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132039626] [2022-07-14 05:51:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:41,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:41,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:41,100 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-14 05:51:41,101 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-14 05:51:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:41,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 05:51:41,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:41,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,352 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-14 05:51:41,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,357 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-14 05:51:41,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,465 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-14 05:51:41,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,471 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-14 05:51:41,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,624 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-14 05:51:41,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,636 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 05:51:41,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 05:51:41,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,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, 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-14 05:51:41,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,756 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:51:41,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-14 05:51:41,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,793 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-14 05:51:41,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,800 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-14 05:51:41,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,854 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-14 05:51:41,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:41,858 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-14 05:51:41,878 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-14 05:51:41,880 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-14 05:51:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:41,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:41,895 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-14 05:51:41,901 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-14 05:51:41,906 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-14 05:51:41,930 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) is different from false [2022-07-14 05:51:41,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 05:51:41,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 05:51:41,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:51:42,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:51:42,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:51:42,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:51:42,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:51:42,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:51:42,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:51:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-14 05:51:42,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132039626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:42,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:51:42,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 41 [2022-07-14 05:51:42,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144693745] [2022-07-14 05:51:42,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:42,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-14 05:51:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:42,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-14 05:51:42,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=632, Unknown=13, NotChecked=832, Total=1640 [2022-07-14 05:51:42,931 INFO L87 Difference]: Start difference. First operand 212 states and 261 transitions. Second operand has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:44,952 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2022-07-14 05:51:44,958 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|))) (and (= |c_sll_append_#in~head#1.offset| 0) (= (select .cse0 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse1 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse1 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse3 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse3 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0))) is different from false [2022-07-14 05:51:44,985 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:51:44,994 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:51:46,998 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:51:49,002 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:51:51,007 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:51:53,014 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:51:55,021 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false [2022-07-14 05:51:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:56,507 INFO L93 Difference]: Finished difference Result 264 states and 321 transitions. [2022-07-14 05:51:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 05:51:56,507 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-14 05:51:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:56,508 INFO L225 Difference]: With dead ends: 264 [2022-07-14 05:51:56,508 INFO L226 Difference]: Without dead ends: 264 [2022-07-14 05:51:56,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=243, Invalid=1083, Unknown=22, NotChecked=1958, Total=3306 [2022-07-14 05:51:56,510 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 26 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:56,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2238 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 336 Invalid, 0 Unknown, 551 Unchecked, 0.2s Time] [2022-07-14 05:51:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-14 05:51:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 243. [2022-07-14 05:51:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.3969849246231156) internal successors, (278), 234 states have internal predecessors, (278), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-14 05:51:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 297 transitions. [2022-07-14 05:51:56,516 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 297 transitions. Word has length 35 [2022-07-14 05:51:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:56,516 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 297 transitions. [2022-07-14 05:51:56,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 297 transitions. [2022-07-14 05:51:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 05:51:56,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:56,517 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:56,537 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-14 05:51:56,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:56,737 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash 762522433, now seen corresponding path program 1 times [2022-07-14 05:51:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:56,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809182448] [2022-07-14 05:51:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 05:51:56,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:56,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809182448] [2022-07-14 05:51:56,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809182448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:56,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:56,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:51:56,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262267576] [2022-07-14 05:51:56,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:56,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:51:56,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:56,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:51:56,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:51:56,756 INFO L87 Difference]: Start difference. First operand 243 states and 297 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:56,762 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2022-07-14 05:51:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:51:56,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-14 05:51:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:56,765 INFO L225 Difference]: With dead ends: 247 [2022-07-14 05:51:56,765 INFO L226 Difference]: Without dead ends: 247 [2022-07-14 05:51:56,766 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-14 05:51:56,767 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:56,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-14 05:51:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-07-14 05:51:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 204 states have (on average 1.3823529411764706) internal successors, (282), 238 states have internal predecessors, (282), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-14 05:51:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 298 transitions. [2022-07-14 05:51:56,771 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 298 transitions. Word has length 35 [2022-07-14 05:51:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:56,772 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 298 transitions. [2022-07-14 05:51:56,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 298 transitions. [2022-07-14 05:51:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 05:51:56,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:56,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:56,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 05:51:56,773 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:56,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash 444674194, now seen corresponding path program 1 times [2022-07-14 05:51:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:56,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625825258] [2022-07-14 05:51:56,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 05:51:56,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:56,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625825258] [2022-07-14 05:51:56,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625825258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:56,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644431519] [2022-07-14 05:51:56,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:56,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:56,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:56,824 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-14 05:51:56,825 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-14 05:51:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:56,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 05:51:56,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 05:51:56,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 05:51:56,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644431519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:56,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:51:56,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-14 05:51:56,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864839459] [2022-07-14 05:51:56,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:56,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 05:51:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:56,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 05:51:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:51:56,998 INFO L87 Difference]: Start difference. First operand 247 states and 298 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:57,052 INFO L93 Difference]: Finished difference Result 263 states and 306 transitions. [2022-07-14 05:51:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:51:57,052 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 05:51:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:57,053 INFO L225 Difference]: With dead ends: 263 [2022-07-14 05:51:57,053 INFO L226 Difference]: Without dead ends: 263 [2022-07-14 05:51:57,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-07-14 05:51:57,054 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 197 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:57,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 899 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-14 05:51:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 255. [2022-07-14 05:51:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 212 states have (on average 1.3679245283018868) internal successors, (290), 246 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-14 05:51:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 306 transitions. [2022-07-14 05:51:57,058 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 306 transitions. Word has length 36 [2022-07-14 05:51:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:57,059 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 306 transitions. [2022-07-14 05:51:57,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 306 transitions. [2022-07-14 05:51:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 05:51:57,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:57,060 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:57,076 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-14 05:51:57,271 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-14 05:51:57,272 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -308582730, now seen corresponding path program 1 times [2022-07-14 05:51:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:57,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656853037] [2022-07-14 05:51:57,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:57,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:57,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:57,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656853037] [2022-07-14 05:51:57,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656853037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:57,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687190526] [2022-07-14 05:51:57,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:57,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:57,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:57,338 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-14 05:51:57,339 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-14 05:51:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:57,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 05:51:57,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:57,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:57,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687190526] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:57,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:51:57,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2022-07-14 05:51:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850710119] [2022-07-14 05:51:57,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:57,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 05:51:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 05:51:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:51:57,519 INFO L87 Difference]: Start difference. First operand 255 states and 306 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:57,639 INFO L93 Difference]: Finished difference Result 369 states and 428 transitions. [2022-07-14 05:51:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 05:51:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-14 05:51:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:57,642 INFO L225 Difference]: With dead ends: 369 [2022-07-14 05:51:57,642 INFO L226 Difference]: Without dead ends: 369 [2022-07-14 05:51:57,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-07-14 05:51:57,643 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 162 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:57,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1150 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:51:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-07-14 05:51:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 318. [2022-07-14 05:51:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 274 states have (on average 1.3722627737226278) internal successors, (376), 308 states have internal predecessors, (376), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:51:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 390 transitions. [2022-07-14 05:51:57,652 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 390 transitions. Word has length 40 [2022-07-14 05:51:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:57,652 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 390 transitions. [2022-07-14 05:51:57,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 390 transitions. [2022-07-14 05:51:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:51:57,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:57,653 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:57,669 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-14 05:51:57,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 05:51:57,861 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:57,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785188, now seen corresponding path program 2 times [2022-07-14 05:51:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:57,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145282182] [2022-07-14 05:51:57,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 05:51:57,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:57,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145282182] [2022-07-14 05:51:57,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145282182] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:57,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612036061] [2022-07-14 05:51:57,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:51:57,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:57,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:57,976 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-14 05:51:57,977 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-14 05:51:58,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:51:58,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:51:58,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 05:51:58,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:58,088 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-14 05:51:58,125 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:51:58,126 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-14 05:51:58,140 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:51:58,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 05:51:58,189 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-14 05:51:58,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-07-14 05:51:58,245 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-14 05:51:58,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-07-14 05:51:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 05:51:58,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:58,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612036061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:58,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 05:51:58,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2022-07-14 05:51:58,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402425693] [2022-07-14 05:51:58,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:58,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:51:58,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:51:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-14 05:51:58,335 INFO L87 Difference]: Start difference. First operand 318 states and 390 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:58,411 INFO L93 Difference]: Finished difference Result 342 states and 414 transitions. [2022-07-14 05:51:58,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:51:58,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-14 05:51:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:58,413 INFO L225 Difference]: With dead ends: 342 [2022-07-14 05:51:58,413 INFO L226 Difference]: Without dead ends: 342 [2022-07-14 05:51:58,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-07-14 05:51:58,413 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 164 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:58,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 328 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-07-14 05:51:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-14 05:51:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 315. [2022-07-14 05:51:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 274 states have (on average 1.354014598540146) internal successors, (371), 305 states have internal predecessors, (371), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 05:51:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 385 transitions. [2022-07-14 05:51:58,419 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 385 transitions. Word has length 44 [2022-07-14 05:51:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:58,419 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 385 transitions. [2022-07-14 05:51:58,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 385 transitions. [2022-07-14 05:51:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:51:58,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:58,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:58,455 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-14 05:51:58,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 05:51:58,637 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting sll_appendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:51:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785189, now seen corresponding path program 1 times [2022-07-14 05:51:58,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:58,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196522511] [2022-07-14 05:51:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:58,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 05:51:58,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:58,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196522511] [2022-07-14 05:51:58,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196522511] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:58,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968529875] [2022-07-14 05:51:58,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:58,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:58,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:58,724 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-14 05:51:58,743 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-14 05:51:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:58,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 05:51:58,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:58,832 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-14 05:51:58,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:58,908 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-14 05:51:58,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:58,930 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-14 05:51:58,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:58,950 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-14 05:51:58,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:58,970 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-14 05:51:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 05:51:59,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 05:51:59,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968529875] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:59,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:51:59,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-07-14 05:51:59,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615317312] [2022-07-14 05:51:59,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:59,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 05:51:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:51:59,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 05:51:59,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-14 05:51:59,997 INFO L87 Difference]: Start difference. First operand 315 states and 385 transitions. Second operand has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:52:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:00,131 INFO L93 Difference]: Finished difference Result 339 states and 409 transitions. [2022-07-14 05:52:00,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:52:00,136 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-14 05:52:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:00,137 INFO L225 Difference]: With dead ends: 339 [2022-07-14 05:52:00,137 INFO L226 Difference]: Without dead ends: 339 [2022-07-14 05:52:00,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-14 05:52:00,138 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 176 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:00,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 357 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 190 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2022-07-14 05:52:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-14 05:52:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 256. [2022-07-14 05:52:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 221 states have (on average 1.3529411764705883) internal successors, (299), 247 states have internal predecessors, (299), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-14 05:52:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 309 transitions. [2022-07-14 05:52:00,145 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 309 transitions. Word has length 44 [2022-07-14 05:52:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:00,145 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 309 transitions. [2022-07-14 05:52:00,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:52:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 309 transitions. [2022-07-14 05:52:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:52:00,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:00,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:00,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-14 05:52:00,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:52:00,364 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash 685803597, now seen corresponding path program 2 times [2022-07-14 05:52:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:00,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747431320] [2022-07-14 05:52:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 05:52:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:00,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747431320] [2022-07-14 05:52:00,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747431320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:52:00,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454280169] [2022-07-14 05:52:00,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:52:00,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:52:00,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:52:00,595 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-14 05:52:00,608 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-14 05:52:00,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:52:00,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:52:00,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-14 05:52:00,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:52:00,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:00,881 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-14 05:52:00,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:00,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, 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-14 05:52:00,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:00,926 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-14 05:52:00,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:00,929 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-14 05:52:00,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:00,962 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-14 05:52:00,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:00,966 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-14 05:52:01,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,016 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-14 05:52:01,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,019 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-14 05:52:01,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,064 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-14 05:52:01,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,070 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-14 05:52:01,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,082 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-14 05:52:01,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,086 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-14 05:52:01,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,137 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-14 05:52:01,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:01,140 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-14 05:52:01,160 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-14 05:52:01,162 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-14 05:52:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 05:52:01,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:52:01,177 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-14 05:52:01,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (<= |v_sll_append_~new_last~0#1.base_13| |c_sll_append_node_create_with_sublist_#res#1.base|)))) is different from false [2022-07-14 05:52:01,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 05:52:01,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 05:52:01,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 05:52:01,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) is different from false [2022-07-14 05:52:03,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:52:03,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1010 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) is different from false [2022-07-14 05:52:05,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1010 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) is different from false [2022-07-14 05:52:05,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) is different from false [2022-07-14 05:52:06,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:52:06,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= 0 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) is different from false [2022-07-14 05:52:08,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) is different from false [2022-07-14 05:52:09,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:52:09,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) is different from false [2022-07-14 05:52:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 28 not checked. [2022-07-14 05:52:10,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454280169] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:52:10,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:52:10,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 20] total 37 [2022-07-14 05:52:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978432062] [2022-07-14 05:52:10,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:52:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 05:52:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:52:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 05:52:10,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=396, Unknown=15, NotChecked=810, Total=1332 [2022-07-14 05:52:10,895 INFO L87 Difference]: Start difference. First operand 256 states and 309 transitions. Second operand has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 34 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:52:12,914 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-14 05:52:14,920 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_sll_append_#in~head#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) is different from false [2022-07-14 05:52:16,924 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|)))))) is different from false [2022-07-14 05:52:18,988 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:52:20,991 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:52:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:21,226 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2022-07-14 05:52:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 05:52:21,226 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 34 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-14 05:52:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:21,227 INFO L225 Difference]: With dead ends: 308 [2022-07-14 05:52:21,227 INFO L226 Difference]: Without dead ends: 308 [2022-07-14 05:52:21,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=166, Invalid=544, Unknown=20, NotChecked=1340, Total=2070 [2022-07-14 05:52:21,228 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 28 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 575 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:21,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1926 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 294 Invalid, 0 Unknown, 575 Unchecked, 0.2s Time] [2022-07-14 05:52:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-14 05:52:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 303. [2022-07-14 05:52:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 265 states have (on average 1.3169811320754716) internal successors, (349), 293 states have internal predecessors, (349), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-14 05:52:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 365 transitions. [2022-07-14 05:52:21,233 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 365 transitions. Word has length 44 [2022-07-14 05:52:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:21,233 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 365 transitions. [2022-07-14 05:52:21,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 34 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:52:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 365 transitions. [2022-07-14 05:52:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:52:21,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:21,234 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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-14 05:52:21,255 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-14 05:52:21,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:52:21,435 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:21,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash -686003701, now seen corresponding path program 1 times [2022-07-14 05:52:21,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:21,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299780593] [2022-07-14 05:52:21,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 05:52:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:21,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299780593] [2022-07-14 05:52:21,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299780593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:52:21,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:52:21,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:52:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276151333] [2022-07-14 05:52:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:52:21,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:52:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:52:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:52:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:52:21,459 INFO L87 Difference]: Start difference. First operand 303 states and 365 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:52:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:21,471 INFO L93 Difference]: Finished difference Result 398 states and 486 transitions. [2022-07-14 05:52:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:52:21,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-14 05:52:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:21,473 INFO L225 Difference]: With dead ends: 398 [2022-07-14 05:52:21,473 INFO L226 Difference]: Without dead ends: 398 [2022-07-14 05:52:21,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-14 05:52:21,474 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:21,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 331 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:52:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-14 05:52:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 307. [2022-07-14 05:52:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 269 states have (on average 1.3011152416356877) internal successors, (350), 297 states have internal predecessors, (350), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-14 05:52:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 366 transitions. [2022-07-14 05:52:21,481 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 366 transitions. Word has length 44 [2022-07-14 05:52:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:21,481 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 366 transitions. [2022-07-14 05:52:21,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:52:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 366 transitions. [2022-07-14 05:52:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 05:52:21,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:21,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:21,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 05:52:21,482 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1834257435, now seen corresponding path program 1 times [2022-07-14 05:52:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:21,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673420102] [2022-07-14 05:52:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 05:52:21,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:21,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673420102] [2022-07-14 05:52:21,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673420102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:52:21,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364483845] [2022-07-14 05:52:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:21,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:52:21,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:52:21,732 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-14 05:52:21,733 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-14 05:52:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:21,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-14 05:52:21,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:52:22,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,080 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-14 05:52:22,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,083 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-14 05:52:22,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,196 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-14 05:52:22,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,200 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-14 05:52:22,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,304 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-14 05:52:22,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,318 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:52:22,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-14 05:52:22,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,362 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-14 05:52:22,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,367 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-14 05:52:22,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,381 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-14 05:52:22,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,386 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-14 05:52:22,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 05:52:22,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:22,442 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-14 05:52:22,463 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-14 05:52:22,464 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-14 05:52:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 05:52:22,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:52:22,481 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-14 05:52:22,486 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-14 05:52:22,490 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-14 05:52:22,512 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-14 05:52:22,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 05:52:22,564 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 05:52:22,617 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 05:52:22,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 05:52:22,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:52:22,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:52:25,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:52:27,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 05:52:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 15 not checked. [2022-07-14 05:52:28,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364483845] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:52:28,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:52:28,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 38 [2022-07-14 05:52:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637107834] [2022-07-14 05:52:28,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:52:28,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-14 05:52:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:52:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-14 05:52:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=544, Unknown=12, NotChecked=708, Total=1406 [2022-07-14 05:52:28,456 INFO L87 Difference]: Start difference. First operand 307 states and 366 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:52:28,465 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-14 05:52:30,481 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|))) (and (= |c_sll_append_#in~head#1.offset| 0) (= (select .cse0 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse2 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse2 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0))) is different from false [2022-07-14 05:52:32,486 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:52:32,492 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:52:34,495 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:52:36,498 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:52:36,507 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:52:36,514 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) 0) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-14 05:52:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:36,838 INFO L93 Difference]: Finished difference Result 356 states and 418 transitions. [2022-07-14 05:52:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 05:52:36,839 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-14 05:52:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:36,840 INFO L225 Difference]: With dead ends: 356 [2022-07-14 05:52:36,840 INFO L226 Difference]: Without dead ends: 356 [2022-07-14 05:52:36,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=222, Invalid=960, Unknown=20, NotChecked=1660, Total=2862 [2022-07-14 05:52:36,841 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 27 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 595 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:36,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1806 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 595 Unchecked, 0.1s Time] [2022-07-14 05:52:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-14 05:52:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 337. [2022-07-14 05:52:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 326 states have internal predecessors, (379), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-14 05:52:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2022-07-14 05:52:36,847 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 47 [2022-07-14 05:52:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:36,847 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2022-07-14 05:52:36,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:52:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2022-07-14 05:52:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 05:52:36,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:36,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:36,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 05:52:37,067 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,SelfDestructingSolverStorable21 [2022-07-14 05:52:37,067 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1659810607, now seen corresponding path program 1 times [2022-07-14 05:52:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:37,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548546161] [2022-07-14 05:52:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:37,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 05:52:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 05:52:37,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:37,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548546161] [2022-07-14 05:52:37,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548546161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:52:37,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:52:37,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:52:37,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956823814] [2022-07-14 05:52:37,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:52:37,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:52:37,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:52:37,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:52:37,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:52:37,119 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:37,200 INFO L93 Difference]: Finished difference Result 393 states and 460 transitions. [2022-07-14 05:52:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:52:37,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-07-14 05:52:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:37,202 INFO L225 Difference]: With dead ends: 393 [2022-07-14 05:52:37,202 INFO L226 Difference]: Without dead ends: 393 [2022-07-14 05:52:37,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:52:37,203 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 192 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:37,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 284 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:52:37,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-07-14 05:52:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 337. [2022-07-14 05:52:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 326 states have internal predecessors, (379), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-14 05:52:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2022-07-14 05:52:37,209 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 54 [2022-07-14 05:52:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:37,210 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2022-07-14 05:52:37,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2022-07-14 05:52:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 05:52:37,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:37,211 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:37,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 05:52:37,211 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:37,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash -85479915, now seen corresponding path program 1 times [2022-07-14 05:52:37,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:37,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313574705] [2022-07-14 05:52:37,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:37,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 05:52:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 05:52:37,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:37,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313574705] [2022-07-14 05:52:37,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313574705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:52:37,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:52:37,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 05:52:37,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521139201] [2022-07-14 05:52:37,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:52:37,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 05:52:37,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:52:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 05:52:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:52:37,334 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:37,599 INFO L93 Difference]: Finished difference Result 547 states and 660 transitions. [2022-07-14 05:52:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 05:52:37,599 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-07-14 05:52:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:37,601 INFO L225 Difference]: With dead ends: 547 [2022-07-14 05:52:37,601 INFO L226 Difference]: Without dead ends: 547 [2022-07-14 05:52:37,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-07-14 05:52:37,602 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 303 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:37,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 534 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:52:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-07-14 05:52:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 350. [2022-07-14 05:52:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 311 states have (on average 1.2861736334405145) internal successors, (400), 338 states have internal predecessors, (400), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-14 05:52:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 419 transitions. [2022-07-14 05:52:37,610 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 419 transitions. Word has length 55 [2022-07-14 05:52:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:37,610 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 419 transitions. [2022-07-14 05:52:37,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 419 transitions. [2022-07-14 05:52:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 05:52:37,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:37,611 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:37,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 05:52:37,611 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -85479914, now seen corresponding path program 1 times [2022-07-14 05:52:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:37,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789024182] [2022-07-14 05:52:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:37,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 05:52:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 05:52:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:37,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789024182] [2022-07-14 05:52:37,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789024182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:52:37,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:52:37,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 05:52:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325445305] [2022-07-14 05:52:37,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:52:37,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 05:52:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:52:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 05:52:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:52:37,782 INFO L87 Difference]: Start difference. First operand 350 states and 419 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:38,111 INFO L93 Difference]: Finished difference Result 556 states and 686 transitions. [2022-07-14 05:52:38,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 05:52:38,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-07-14 05:52:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:38,113 INFO L225 Difference]: With dead ends: 556 [2022-07-14 05:52:38,113 INFO L226 Difference]: Without dead ends: 556 [2022-07-14 05:52:38,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-14 05:52:38,113 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 273 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:38,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 656 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:52:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-07-14 05:52:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2022-07-14 05:52:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 347 states have (on average 1.3112391930835734) internal successors, (455), 374 states have internal predecessors, (455), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-14 05:52:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 474 transitions. [2022-07-14 05:52:38,120 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 474 transitions. Word has length 55 [2022-07-14 05:52:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:38,120 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 474 transitions. [2022-07-14 05:52:38,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 474 transitions. [2022-07-14 05:52:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 05:52:38,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:38,121 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:38,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 05:52:38,121 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1645084350, now seen corresponding path program 1 times [2022-07-14 05:52:38,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:38,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423873797] [2022-07-14 05:52:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:38,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:38,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 05:52:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 05:52:38,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:38,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423873797] [2022-07-14 05:52:38,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423873797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:52:38,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:52:38,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 05:52:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016382904] [2022-07-14 05:52:38,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:52:38,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:52:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:52:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:52:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:52:38,203 INFO L87 Difference]: Start difference. First operand 386 states and 474 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:38,345 INFO L93 Difference]: Finished difference Result 441 states and 545 transitions. [2022-07-14 05:52:38,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:52:38,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-07-14 05:52:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:38,347 INFO L225 Difference]: With dead ends: 441 [2022-07-14 05:52:38,347 INFO L226 Difference]: Without dead ends: 441 [2022-07-14 05:52:38,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:52:38,348 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 48 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:38,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 597 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:52:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-07-14 05:52:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 421. [2022-07-14 05:52:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3350785340314135) internal successors, (510), 409 states have internal predecessors, (510), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-14 05:52:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 529 transitions. [2022-07-14 05:52:38,353 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 529 transitions. Word has length 56 [2022-07-14 05:52:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:38,353 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 529 transitions. [2022-07-14 05:52:38,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 529 transitions. [2022-07-14 05:52:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 05:52:38,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:38,354 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:38,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 05:52:38,354 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:38,355 INFO L85 PathProgramCache]: Analyzing trace with hash -541993187, now seen corresponding path program 1 times [2022-07-14 05:52:38,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:38,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324310230] [2022-07-14 05:52:38,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:38,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:38,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 05:52:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 05:52:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:38,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324310230] [2022-07-14 05:52:38,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324310230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:52:38,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:52:38,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 05:52:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585136525] [2022-07-14 05:52:38,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:52:38,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 05:52:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:52:38,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 05:52:38,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:52:38,453 INFO L87 Difference]: Start difference. First operand 421 states and 529 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:38,666 INFO L93 Difference]: Finished difference Result 560 states and 704 transitions. [2022-07-14 05:52:38,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 05:52:38,675 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-07-14 05:52:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:38,677 INFO L225 Difference]: With dead ends: 560 [2022-07-14 05:52:38,677 INFO L226 Difference]: Without dead ends: 560 [2022-07-14 05:52:38,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-07-14 05:52:38,678 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 179 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:38,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 763 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:52:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-07-14 05:52:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2022-07-14 05:52:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3219895287958114) internal successors, (505), 409 states have internal predecessors, (505), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-14 05:52:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 524 transitions. [2022-07-14 05:52:38,685 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 524 transitions. Word has length 57 [2022-07-14 05:52:38,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:38,686 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 524 transitions. [2022-07-14 05:52:38,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 524 transitions. [2022-07-14 05:52:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 05:52:38,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:38,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:38,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 05:52:38,687 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:38,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash 383583177, now seen corresponding path program 1 times [2022-07-14 05:52:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:38,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976805211] [2022-07-14 05:52:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:38,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 05:52:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-14 05:52:39,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:39,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976805211] [2022-07-14 05:52:39,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976805211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:52:39,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:52:39,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-14 05:52:39,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52824037] [2022-07-14 05:52:39,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:52:39,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 05:52:39,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:52:39,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 05:52:39,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-07-14 05:52:39,081 INFO L87 Difference]: Start difference. First operand 421 states and 524 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:39,889 INFO L93 Difference]: Finished difference Result 703 states and 878 transitions. [2022-07-14 05:52:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 05:52:39,890 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-07-14 05:52:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:39,892 INFO L225 Difference]: With dead ends: 703 [2022-07-14 05:52:39,892 INFO L226 Difference]: Without dead ends: 703 [2022-07-14 05:52:39,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2022-07-14 05:52:39,893 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 594 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:39,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 862 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 05:52:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-07-14 05:52:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 458. [2022-07-14 05:52:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 419 states have (on average 1.331742243436754) internal successors, (558), 445 states have internal predecessors, (558), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-14 05:52:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 577 transitions. [2022-07-14 05:52:39,901 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 577 transitions. Word has length 58 [2022-07-14 05:52:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:39,901 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 577 transitions. [2022-07-14 05:52:39,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:39,901 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 577 transitions. [2022-07-14 05:52:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 05:52:39,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:39,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:39,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 05:52:39,902 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:39,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:39,903 INFO L85 PathProgramCache]: Analyzing trace with hash 383583178, now seen corresponding path program 1 times [2022-07-14 05:52:39,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:39,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863700813] [2022-07-14 05:52:39,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:39,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 05:52:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 05:52:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:40,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863700813] [2022-07-14 05:52:40,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863700813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:52:40,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:52:40,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-14 05:52:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028442822] [2022-07-14 05:52:40,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:52:40,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 05:52:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:52:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 05:52:40,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-14 05:52:40,298 INFO L87 Difference]: Start difference. First operand 458 states and 577 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:52:41,388 INFO L93 Difference]: Finished difference Result 760 states and 937 transitions. [2022-07-14 05:52:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-14 05:52:41,399 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-07-14 05:52:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:52:41,401 INFO L225 Difference]: With dead ends: 760 [2022-07-14 05:52:41,401 INFO L226 Difference]: Without dead ends: 760 [2022-07-14 05:52:41,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2022-07-14 05:52:41,406 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 627 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 05:52:41,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 914 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 05:52:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-07-14 05:52:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 458. [2022-07-14 05:52:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 419 states have (on average 1.3269689737470167) internal successors, (556), 445 states have internal predecessors, (556), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-14 05:52:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 575 transitions. [2022-07-14 05:52:41,416 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 575 transitions. Word has length 58 [2022-07-14 05:52:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:52:41,416 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 575 transitions. [2022-07-14 05:52:41,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:52:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 575 transitions. [2022-07-14 05:52:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-14 05:52:41,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:52:41,417 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:52:41,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 05:52:41,417 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 05:52:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:52:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1581411742, now seen corresponding path program 1 times [2022-07-14 05:52:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:52:41,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520077567] [2022-07-14 05:52:41,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:41,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:52:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:41,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 05:52:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 05:52:42,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:52:42,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520077567] [2022-07-14 05:52:42,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520077567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:52:42,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337548178] [2022-07-14 05:52:42,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:52:42,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:52:42,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:52:42,311 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-14 05:52:42,336 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-14 05:52:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:52:42,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 124 conjunts are in the unsatisfiable core [2022-07-14 05:52:42,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:52:42,483 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-14 05:52:42,631 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:52:42,756 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:52:42,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:52:42,814 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-14 05:52:42,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:52:43,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:43,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-07-14 05:52:43,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:43,092 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 26 [2022-07-14 05:52:43,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:43,201 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 05:52:43,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 51 [2022-07-14 05:52:43,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:43,218 INFO L356 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-07-14 05:52:43,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 46 [2022-07-14 05:52:43,507 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 05:52:43,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 51 [2022-07-14 05:52:43,519 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-14 05:52:43,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-07-14 05:52:44,009 INFO L356 Elim1Store]: treesize reduction 68, result has 50.7 percent of original size [2022-07-14 05:52:44,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 64 treesize of output 104 [2022-07-14 05:52:44,052 INFO L356 Elim1Store]: treesize reduction 96, result has 30.4 percent of original size [2022-07-14 05:52:44,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 58 [2022-07-14 05:52:44,663 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 05:52:44,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-14 05:52:46,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:46,336 INFO L356 Elim1Store]: treesize reduction 79, result has 16.0 percent of original size [2022-07-14 05:52:46,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 246 treesize of output 138 [2022-07-14 05:52:46,359 INFO L356 Elim1Store]: treesize reduction 91, result has 9.9 percent of original size [2022-07-14 05:52:46,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 99 treesize of output 66 [2022-07-14 05:52:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 05:52:46,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:52:47,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:52:47,881 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 1683 treesize of output 1675 [2022-07-14 05:52:47,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:47,911 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:52:47,912 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 663 treesize of output 659 [2022-07-14 05:52:47,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:47,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:47,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:47,955 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-14 05:52:47,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 272 treesize of output 264 [2022-07-14 05:52:50,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:51,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:52:51,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:53:29,135 WARN L233 SmtUtils]: Spent 37.67s on a formula simplification. DAG size of input: 1546 DAG size of output: 912 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-14 05:53:29,140 INFO L356 Elim1Store]: treesize reduction 48527, result has 42.7 percent of original size [2022-07-14 05:53:29,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 31 select indices, 31 select index equivalence classes, 3 disjoint index pairs (out of 465 index pairs), introduced 38 new quantified variables, introduced 465 case distinctions, treesize of input 1073236853 treesize of output 980622296