./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:29:14,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:29:14,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:29:14,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:29:14,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:29:14,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:29:14,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:29:14,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:29:14,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:29:14,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:29:14,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:29:14,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:29:14,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:29:14,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:29:14,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:29:14,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:29:14,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:29:14,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:29:14,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:29:14,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:29:14,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:29:14,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:29:14,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:29:14,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:29:14,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:29:14,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:29:14,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:29:14,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:29:14,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:29:14,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:29:14,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:29:14,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:29:14,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:29:14,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:29:14,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:29:14,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:29:14,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:29:14,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:29:14,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:29:14,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:29:14,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:29:14,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-14 19:29:14,670 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:29:14,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:29:14,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:29:14,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:29:14,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:29:14,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:29:14,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:29:14,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:29:14,677 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:29:14,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:29:14,678 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:29:14,678 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:29:14,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:29:14,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:29:14,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:29:14,679 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:29:14,679 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:29:14,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:29:14,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:29:14,679 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:29:14,680 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:29:14,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:29:14,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:29:14,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:29:14,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:29:14,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:29:14,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:29:14,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:29:14,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:29:14,683 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:29:14,683 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 [2021-12-14 19:29:14,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:29:14,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:29:14,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:29:14,900 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:29:14,901 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:29:14,902 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 [2021-12-14 19:29:14,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d3f2501/6b981badc3734af786d92a426812efa8/FLAG82f3227f0 [2021-12-14 19:29:15,340 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:29:15,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2021-12-14 19:29:15,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d3f2501/6b981badc3734af786d92a426812efa8/FLAG82f3227f0 [2021-12-14 19:29:15,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d3f2501/6b981badc3734af786d92a426812efa8 [2021-12-14 19:29:15,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:29:15,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:29:15,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:29:15,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:29:15,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:29:15,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c0858d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15, skipping insertion in model container [2021-12-14 19:29:15,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:29:15,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:29:15,637 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] [2021-12-14 19:29:15,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:29:15,648 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:29:15,689 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] [2021-12-14 19:29:15,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:29:15,705 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:29:15,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15 WrapperNode [2021-12-14 19:29:15,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:29:15,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:29:15,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:29:15,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:29:15,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,735 INFO L137 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2021-12-14 19:29:15,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:29:15,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:29:15,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:29:15,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:29:15,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:29:15,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:29:15,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:29:15,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:29:15,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (1/1) ... [2021-12-14 19:29:15,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:29:15,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:15,782 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) [2021-12-14 19:29:15,783 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 [2021-12-14 19:29:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-14 19:29:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-14 19:29:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:29:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:29:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:29:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:29:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2021-12-14 19:29:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2021-12-14 19:29:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:29:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:29:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 19:29:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:29:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:29:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:29:15,901 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:29:15,902 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:29:15,933 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-14 19:29:16,148 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:29:16,153 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:29:16,155 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-14 19:29:16,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:29:16 BoogieIcfgContainer [2021-12-14 19:29:16,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:29:16,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:29:16,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:29:16,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:29:16,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:29:15" (1/3) ... [2021-12-14 19:29:16,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eae9c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:29:16, skipping insertion in model container [2021-12-14 19:29:16,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:15" (2/3) ... [2021-12-14 19:29:16,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eae9c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:29:16, skipping insertion in model container [2021-12-14 19:29:16,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:29:16" (3/3) ... [2021-12-14 19:29:16,164 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2021-12-14 19:29:16,169 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:29:16,169 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-12-14 19:29:16,194 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:29:16,198 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:29:16,199 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-12-14 19:29:16,211 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) [2021-12-14 19:29:16,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:29:16,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:16,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:16,216 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr1REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash -46006015, now seen corresponding path program 1 times [2021-12-14 19:29:16,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:16,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510779151] [2021-12-14 19:29:16,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:16,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:16,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:16,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510779151] [2021-12-14 19:29:16,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510779151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:16,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:16,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:16,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836844434] [2021-12-14 19:29:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:16,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:16,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:16,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:16,386 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) [2021-12-14 19:29:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:16,450 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2021-12-14 19:29:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:16,452 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 [2021-12-14 19:29:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:16,466 INFO L225 Difference]: With dead ends: 128 [2021-12-14 19:29:16,466 INFO L226 Difference]: Without dead ends: 122 [2021-12-14 19:29:16,468 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:29:16,470 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:16,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 259 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-14 19:29:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2021-12-14 19:29:16,499 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) [2021-12-14 19:29:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2021-12-14 19:29:16,502 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 10 [2021-12-14 19:29:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:16,502 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2021-12-14 19:29:16,502 INFO L471 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) [2021-12-14 19:29:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2021-12-14 19:29:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:29:16,503 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:16,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:16,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:29:16,503 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr1REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash 244152622, now seen corresponding path program 1 times [2021-12-14 19:29:16,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:16,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7172896] [2021-12-14 19:29:16,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:16,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:16,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:16,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7172896] [2021-12-14 19:29:16,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7172896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:16,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:16,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:29:16,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910462732] [2021-12-14 19:29:16,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:16,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:16,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:16,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:16,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:16,553 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) [2021-12-14 19:29:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:16,619 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2021-12-14 19:29:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:16,620 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 [2021-12-14 19:29:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:16,622 INFO L225 Difference]: With dead ends: 151 [2021-12-14 19:29:16,622 INFO L226 Difference]: Without dead ends: 151 [2021-12-14 19:29:16,622 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:29:16,623 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2021-12-14 19:29:16,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 234 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-14 19:29:16,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2021-12-14 19:29:16,634 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) [2021-12-14 19:29:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2021-12-14 19:29:16,639 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 13 [2021-12-14 19:29:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:16,641 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2021-12-14 19:29:16,642 INFO L471 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) [2021-12-14 19:29:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2021-12-14 19:29:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:29:16,643 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:16,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:16,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:29:16,643 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr0REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:16,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash 244152621, now seen corresponding path program 1 times [2021-12-14 19:29:16,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:16,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216580385] [2021-12-14 19:29:16,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:16,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:16,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:16,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216580385] [2021-12-14 19:29:16,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216580385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:16,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:16,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:29:16,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462520336] [2021-12-14 19:29:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:16,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:16,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:16,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:16,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:16,705 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) [2021-12-14 19:29:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:16,784 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2021-12-14 19:29:16,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:16,785 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 [2021-12-14 19:29:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:16,786 INFO L225 Difference]: With dead ends: 150 [2021-12-14 19:29:16,786 INFO L226 Difference]: Without dead ends: 150 [2021-12-14 19:29:16,786 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:29:16,787 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2021-12-14 19:29:16,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 228 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-14 19:29:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 114. [2021-12-14 19:29:16,797 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) [2021-12-14 19:29:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2021-12-14 19:29:16,798 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2021-12-14 19:29:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:16,798 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2021-12-14 19:29:16,798 INFO L471 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) [2021-12-14 19:29:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2021-12-14 19:29:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:29:16,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:16,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:16,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:29:16,799 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253985, now seen corresponding path program 1 times [2021-12-14 19:29:16,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:16,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431494704] [2021-12-14 19:29:16,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:16,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:16,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:16,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431494704] [2021-12-14 19:29:16,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431494704] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:16,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:16,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:29:16,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315964926] [2021-12-14 19:29:16,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:16,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:29:16,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:16,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:29:16,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:29:16,861 INFO L87 Difference]: Start difference. First operand 114 states and 128 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) [2021-12-14 19:29:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:16,918 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2021-12-14 19:29:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:29:16,919 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 [2021-12-14 19:29:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:16,919 INFO L225 Difference]: With dead ends: 166 [2021-12-14 19:29:16,920 INFO L226 Difference]: Without dead ends: 166 [2021-12-14 19:29:16,920 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:29:16,924 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 98 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:16,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 707 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-14 19:29:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 146. [2021-12-14 19:29:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 101 states have (on average 1.7326732673267327) internal successors, (175), 140 states have internal predecessors, (175), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:29:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 181 transitions. [2021-12-14 19:29:16,935 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 181 transitions. Word has length 14 [2021-12-14 19:29:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:16,935 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 181 transitions. [2021-12-14 19:29:16,935 INFO L471 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) [2021-12-14 19:29:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 181 transitions. [2021-12-14 19:29:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:29:16,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:16,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:16,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:29:16,937 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash -790832605, now seen corresponding path program 1 times [2021-12-14 19:29:16,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:16,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924890092] [2021-12-14 19:29:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:16,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:17,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:17,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924890092] [2021-12-14 19:29:17,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924890092] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:17,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852085669] [2021-12-14 19:29:17,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:17,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:17,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:17,019 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) [2021-12-14 19:29:17,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:29:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:17,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:29:17,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:17,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:17,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852085669] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:17,279 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:17,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2021-12-14 19:29:17,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057910931] [2021-12-14 19:29:17,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:17,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:29:17,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:29:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:29:17,300 INFO L87 Difference]: Start difference. First operand 146 states and 181 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 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) [2021-12-14 19:29:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:17,412 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2021-12-14 19:29:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:29:17,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 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 16 [2021-12-14 19:29:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:17,414 INFO L225 Difference]: With dead ends: 243 [2021-12-14 19:29:17,414 INFO L226 Difference]: Without dead ends: 243 [2021-12-14 19:29:17,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:29:17,419 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 291 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:17,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 896 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-14 19:29:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 185. [2021-12-14 19:29:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 138 states have (on average 1.6956521739130435) internal successors, (234), 177 states have internal predecessors, (234), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 19:29:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 242 transitions. [2021-12-14 19:29:17,434 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 242 transitions. Word has length 16 [2021-12-14 19:29:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:17,434 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 242 transitions. [2021-12-14 19:29:17,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 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) [2021-12-14 19:29:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2021-12-14 19:29:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 19:29:17,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:17,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:17,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:17,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:17,641 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash -924446424, now seen corresponding path program 1 times [2021-12-14 19:29:17,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:17,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293259517] [2021-12-14 19:29:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:17,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:17,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:17,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293259517] [2021-12-14 19:29:17,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293259517] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:17,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628155760] [2021-12-14 19:29:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:17,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:17,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:17,705 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) [2021-12-14 19:29:17,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:29:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:17,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:29:17,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:17,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:17,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628155760] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:17,922 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:17,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2021-12-14 19:29:17,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970683841] [2021-12-14 19:29:17,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:17,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:29:17,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:29:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:29:17,923 INFO L87 Difference]: Start difference. First operand 185 states and 242 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:29:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:18,022 INFO L93 Difference]: Finished difference Result 278 states and 327 transitions. [2021-12-14 19:29:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:29:18,023 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 2 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 18 [2021-12-14 19:29:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:18,024 INFO L225 Difference]: With dead ends: 278 [2021-12-14 19:29:18,024 INFO L226 Difference]: Without dead ends: 278 [2021-12-14 19:29:18,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:29:18,026 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 304 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:18,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 1205 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-14 19:29:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 202. [2021-12-14 19:29:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 155 states have (on average 1.6193548387096774) internal successors, (251), 194 states have internal predecessors, (251), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 19:29:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 259 transitions. [2021-12-14 19:29:18,037 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 259 transitions. Word has length 18 [2021-12-14 19:29:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:18,038 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 259 transitions. [2021-12-14 19:29:18,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:29:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2021-12-14 19:29:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:29:18,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:18,043 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:18,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-14 19:29:18,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 19:29:18,259 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:18,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676230, now seen corresponding path program 2 times [2021-12-14 19:29:18,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:18,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266491001] [2021-12-14 19:29:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:18,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:29:18,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:18,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266491001] [2021-12-14 19:29:18,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266491001] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:18,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827371209] [2021-12-14 19:29:18,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:29:18,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:18,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:18,369 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) [2021-12-14 19:29:18,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:29:18,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:29:18,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:29:18,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:29:18,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:18,471 INFO L388 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 [2021-12-14 19:29:18,498 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:29:18,498 INFO L388 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 [2021-12-14 19:29:18,521 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:29:18,522 INFO L388 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 [2021-12-14 19:29:18,559 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:18,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:29:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 19:29:18,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:29:18,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827371209] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:18,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:18,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-14 19:29:18,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778265419] [2021-12-14 19:29:18,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:18,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:29:18,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:18,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:29:18,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:29:18,683 INFO L87 Difference]: Start difference. First operand 202 states and 259 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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) [2021-12-14 19:29:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:18,745 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2021-12-14 19:29:18,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:29:18,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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 26 [2021-12-14 19:29:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:18,747 INFO L225 Difference]: With dead ends: 200 [2021-12-14 19:29:18,747 INFO L226 Difference]: Without dead ends: 200 [2021-12-14 19:29:18,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:29:18,748 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 73 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:18,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 331 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2021-12-14 19:29:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-14 19:29:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-12-14 19:29:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 155 states have (on average 1.5806451612903225) internal successors, (245), 192 states have internal predecessors, (245), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 19:29:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 253 transitions. [2021-12-14 19:29:18,751 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 253 transitions. Word has length 26 [2021-12-14 19:29:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:18,751 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 253 transitions. [2021-12-14 19:29:18,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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) [2021-12-14 19:29:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 253 transitions. [2021-12-14 19:29:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:29:18,752 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:18,752 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:18,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:18,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:18,957 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676229, now seen corresponding path program 1 times [2021-12-14 19:29:18,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:18,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075075878] [2021-12-14 19:29:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:18,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 19:29:19,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:19,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075075878] [2021-12-14 19:29:19,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075075878] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:19,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748125537] [2021-12-14 19:29:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:19,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:19,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:19,024 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) [2021-12-14 19:29:19,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:29:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:19,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 19:29:19,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:19,110 INFO L388 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 [2021-12-14 19:29:19,113 INFO L388 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 [2021-12-14 19:29:19,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:19,141 INFO L388 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 [2021-12-14 19:29:19,150 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:29:19,151 INFO L388 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 [2021-12-14 19:29:19,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:19,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:29:19,243 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-14 19:29:19,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-14 19:29:19,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:19,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:29:19,388 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-14 19:29:19,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-12-14 19:29:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:19,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:20,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748125537] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:20,143 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:20,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2021-12-14 19:29:20,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196029800] [2021-12-14 19:29:20,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:20,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 19:29:20,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:20,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 19:29:20,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:29:20,144 INFO L87 Difference]: Start difference. First operand 200 states and 253 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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) [2021-12-14 19:29:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:20,241 INFO L93 Difference]: Finished difference Result 206 states and 258 transitions. [2021-12-14 19:29:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:29:20,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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 [2021-12-14 19:29:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:20,242 INFO L225 Difference]: With dead ends: 206 [2021-12-14 19:29:20,243 INFO L226 Difference]: Without dead ends: 206 [2021-12-14 19:29:20,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:29:20,243 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 37 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:20,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 325 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 116 Unchecked, 0.0s Time] [2021-12-14 19:29:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-14 19:29:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2021-12-14 19:29:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 155 states have (on average 1.5612903225806452) internal successors, (242), 191 states have internal predecessors, (242), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 19:29:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2021-12-14 19:29:20,247 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 26 [2021-12-14 19:29:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:20,247 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2021-12-14 19:29:20,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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) [2021-12-14 19:29:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2021-12-14 19:29:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:29:20,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:20,252 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:20,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:20,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:20,459 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr5REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:20,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:20,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1579803684, now seen corresponding path program 1 times [2021-12-14 19:29:20,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:20,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317346405] [2021-12-14 19:29:20,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:20,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 19:29:20,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:20,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317346405] [2021-12-14 19:29:20,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317346405] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:20,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:20,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:20,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395722957] [2021-12-14 19:29:20,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:20,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:29:20,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:20,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:29:20,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:29:20,497 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2021-12-14 19:29:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:20,513 INFO L93 Difference]: Finished difference Result 198 states and 247 transitions. [2021-12-14 19:29:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:20,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 28 [2021-12-14 19:29:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:20,514 INFO L225 Difference]: With dead ends: 198 [2021-12-14 19:29:20,514 INFO L226 Difference]: Without dead ends: 198 [2021-12-14 19:29:20,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:29:20,515 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:20,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 188 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-14 19:29:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-14 19:29:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.5419354838709678) internal successors, (239), 190 states have internal predecessors, (239), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 19:29:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2021-12-14 19:29:20,519 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 28 [2021-12-14 19:29:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:20,519 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2021-12-14 19:29:20,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2021-12-14 19:29:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2021-12-14 19:29:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:29:20,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:20,520 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:20,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:29:20,520 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting sll_appendErr6REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash 320066679, now seen corresponding path program 1 times [2021-12-14 19:29:20,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:20,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638604685] [2021-12-14 19:29:20,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:20,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 19:29:20,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:20,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638604685] [2021-12-14 19:29:20,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638604685] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:20,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:20,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:29:20,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126006062] [2021-12-14 19:29:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:20,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:29:20,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:29:20,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:29:20,554 INFO L87 Difference]: Start difference. First operand 198 states and 247 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) [2021-12-14 19:29:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:20,619 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2021-12-14 19:29:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:29:20,620 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 [2021-12-14 19:29:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:20,621 INFO L225 Difference]: With dead ends: 197 [2021-12-14 19:29:20,621 INFO L226 Difference]: Without dead ends: 197 [2021-12-14 19:29:20,621 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:29:20,622 INFO L933 BasicCegarLoop]: 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 [2021-12-14 19:29:20,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 288 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-14 19:29:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-14 19:29:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 155 states have (on average 1.5225806451612902) internal successors, (236), 189 states have internal predecessors, (236), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 19:29:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2021-12-14 19:29:20,626 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 31 [2021-12-14 19:29:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:20,626 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2021-12-14 19:29:20,626 INFO L471 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) [2021-12-14 19:29:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2021-12-14 19:29:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:29:20,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:20,627 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:20,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:29:20,627 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting sll_appendErr7REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:20,627 INFO L85 PathProgramCache]: Analyzing trace with hash 320066680, now seen corresponding path program 1 times [2021-12-14 19:29:20,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:20,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666686466] [2021-12-14 19:29:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:20,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 19:29:20,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:20,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666686466] [2021-12-14 19:29:20,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666686466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:20,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:20,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:29:20,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899748102] [2021-12-14 19:29:20,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:20,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:29:20,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:20,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:29:20,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:29:20,680 INFO L87 Difference]: Start difference. First operand 197 states and 244 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) [2021-12-14 19:29:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:20,746 INFO L93 Difference]: Finished difference Result 196 states and 241 transitions. [2021-12-14 19:29:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:29:20,746 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 [2021-12-14 19:29:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:20,747 INFO L225 Difference]: With dead ends: 196 [2021-12-14 19:29:20,747 INFO L226 Difference]: Without dead ends: 196 [2021-12-14 19:29:20,748 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:29:20,748 INFO L933 BasicCegarLoop]: 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 [2021-12-14 19:29:20,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 326 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:20,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-14 19:29:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-12-14 19:29:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 155 states have (on average 1.5032258064516129) internal successors, (233), 188 states have internal predecessors, (233), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 19:29:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 241 transitions. [2021-12-14 19:29:20,752 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 241 transitions. Word has length 31 [2021-12-14 19:29:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:20,752 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 241 transitions. [2021-12-14 19:29:20,752 INFO L471 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) [2021-12-14 19:29:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 241 transitions. [2021-12-14 19:29:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:29:20,753 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:20,753 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:20,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:29:20,753 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting sll_appendErr8REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:20,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:20,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132480, now seen corresponding path program 1 times [2021-12-14 19:29:20,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:20,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567662840] [2021-12-14 19:29:20,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:20,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:29:20,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:20,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567662840] [2021-12-14 19:29:20,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567662840] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:20,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325141209] [2021-12-14 19:29:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:20,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:20,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:20,872 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) [2021-12-14 19:29:20,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:29:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:20,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-14 19:29:20,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:20,962 INFO L388 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 [2021-12-14 19:29:20,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:20,996 INFO L388 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 [2021-12-14 19:29:21,016 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:21,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:29:21,061 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:21,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:29:21,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:21,086 INFO L388 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 [2021-12-14 19:29:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 19:29:21,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 19:29:21,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325141209] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:21,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:21,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2021-12-14 19:29:21,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523986623] [2021-12-14 19:29:21,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:21,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:29:21,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:21,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:29:21,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:29:21,406 INFO L87 Difference]: Start difference. First operand 196 states and 241 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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) [2021-12-14 19:29:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:21,504 INFO L93 Difference]: Finished difference Result 292 states and 358 transitions. [2021-12-14 19:29:21,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:29:21,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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 [2021-12-14 19:29:21,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:21,506 INFO L225 Difference]: With dead ends: 292 [2021-12-14 19:29:21,506 INFO L226 Difference]: Without dead ends: 292 [2021-12-14 19:29:21,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:29:21,507 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 79 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:21,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 463 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 143 Unchecked, 0.1s Time] [2021-12-14 19:29:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-12-14 19:29:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 283. [2021-12-14 19:29:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 273 states have internal predecessors, (342), 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) [2021-12-14 19:29:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 356 transitions. [2021-12-14 19:29:21,513 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 356 transitions. Word has length 32 [2021-12-14 19:29:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:21,513 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 356 transitions. [2021-12-14 19:29:21,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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) [2021-12-14 19:29:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 356 transitions. [2021-12-14 19:29:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:29:21,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:21,514 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:21,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:21,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 19:29:21,726 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting sll_appendErr9REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:21,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:21,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132481, now seen corresponding path program 1 times [2021-12-14 19:29:21,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:21,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373486406] [2021-12-14 19:29:21,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:21,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 19:29:21,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:21,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373486406] [2021-12-14 19:29:21,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373486406] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:21,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680302168] [2021-12-14 19:29:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:21,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:21,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:21,806 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) [2021-12-14 19:29:21,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:29:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:21,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-14 19:29:21,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:21,892 INFO L388 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 [2021-12-14 19:29:21,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:21,938 INFO L388 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 [2021-12-14 19:29:21,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:21,961 INFO L388 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 [2021-12-14 19:29:21,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:21,983 INFO L388 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 [2021-12-14 19:29:22,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:22,005 INFO L388 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 [2021-12-14 19:29:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 19:29:22,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 19:29:22,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680302168] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:22,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:22,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-12-14 19:29:22,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178329989] [2021-12-14 19:29:22,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:22,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:29:22,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:22,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:29:22,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:29:22,866 INFO L87 Difference]: Start difference. First operand 283 states and 356 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) [2021-12-14 19:29:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:22,992 INFO L93 Difference]: Finished difference Result 304 states and 371 transitions. [2021-12-14 19:29:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:29:22,993 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 [2021-12-14 19:29:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:22,994 INFO L225 Difference]: With dead ends: 304 [2021-12-14 19:29:22,995 INFO L226 Difference]: Without dead ends: 304 [2021-12-14 19:29:22,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:29:22,995 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 180 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:22,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 347 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 102 Unchecked, 0.1s Time] [2021-12-14 19:29:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-12-14 19:29:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 277. [2021-12-14 19:29:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 267 states have internal predecessors, (328), 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) [2021-12-14 19:29:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 342 transitions. [2021-12-14 19:29:23,001 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 342 transitions. Word has length 32 [2021-12-14 19:29:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:23,002 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 342 transitions. [2021-12-14 19:29:23,002 INFO L471 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) [2021-12-14 19:29:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 342 transitions. [2021-12-14 19:29:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:29:23,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:23,003 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:23,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:23,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:23,223 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:23,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:23,224 INFO L85 PathProgramCache]: Analyzing trace with hash 60922559, now seen corresponding path program 1 times [2021-12-14 19:29:23,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:23,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055900261] [2021-12-14 19:29:23,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:23,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 19:29:23,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:23,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055900261] [2021-12-14 19:29:23,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055900261] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:23,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305323377] [2021-12-14 19:29:23,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:23,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:23,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:23,433 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) [2021-12-14 19:29:23,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 19:29:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:23,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-14 19:29:23,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:23,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:23,727 INFO L388 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 [2021-12-14 19:29:23,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:23,731 INFO L388 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 [2021-12-14 19:29:23,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:23,868 INFO L388 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 [2021-12-14 19:29:23,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:23,871 INFO L388 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 [2021-12-14 19:29:23,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:23,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:24,006 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:29:24,007 INFO L388 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 [2021-12-14 19:29:24,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:24,014 INFO L388 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 [2021-12-14 19:29:24,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:24,087 INFO L388 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 [2021-12-14 19:29:24,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:24,094 INFO L388 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 [2021-12-14 19:29:24,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:24,113 INFO L388 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 [2021-12-14 19:29:24,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:24,116 INFO L388 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 [2021-12-14 19:29:24,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:24,176 INFO L388 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 [2021-12-14 19:29:24,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:24,180 INFO L388 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 [2021-12-14 19:29:24,205 INFO L388 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 [2021-12-14 19:29:24,207 INFO L388 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 [2021-12-14 19:29:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:24,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:24,232 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-14 19:29:24,240 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-14 19:29:24,250 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-14 19:29:24,281 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-14 19:29:24,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|))) is different from false [2021-12-14 19:29:24,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (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_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|))) is different from false [2021-12-14 19:29:24,433 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-14 19:29:24,508 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-14 19:29:24,633 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (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_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-14 19:29:24,825 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-14 19:29:25,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_589) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_590) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-14 19:29:27,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_589) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_590) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-14 19:29:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2021-12-14 19:29:28,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305323377] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:28,064 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:28,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 38 [2021-12-14 19:29:28,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449620367] [2021-12-14 19:29:28,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:28,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-14 19:29:28,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-14 19:29:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=544, Unknown=12, NotChecked=708, Total=1406 [2021-12-14 19:29:28,067 INFO L87 Difference]: Start difference. First operand 277 states and 342 transitions. Second operand has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 35 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) [2021-12-14 19:29:30,079 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_589) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_590) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) (= (select (select |c_#memory_$Pointer$.base| |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|) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (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)) is different from false [2021-12-14 19:29:30,086 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|))) (and (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0) (= |c_sll_append_#in~head#1.offset| 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse1 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse1 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_589) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_590) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (= (select .cse0 0) 0) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|))) is different from false [2021-12-14 19:29:32,089 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-14 19:29:34,094 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |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) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (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_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|)))) is different from false [2021-12-14 19:29:36,100 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) (= (select (select |c_#memory_$Pointer$.offset| |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)) is different from false [2021-12-14 19:29:36,104 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (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_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-14 19:29:36,124 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (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_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|))) (< |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)) is different from false [2021-12-14 19:29:36,126 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |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|) 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)) is different from false [2021-12-14 19:29:36,129 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#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|) 0) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-14 19:29:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:38,652 INFO L93 Difference]: Finished difference Result 317 states and 387 transitions. [2021-12-14 19:29:38,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:29:38,653 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 35 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 [2021-12-14 19:29:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:38,654 INFO L225 Difference]: With dead ends: 317 [2021-12-14 19:29:38,654 INFO L226 Difference]: Without dead ends: 317 [2021-12-14 19:29:38,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=217, Invalid=838, Unknown=21, NotChecked=1680, Total=2756 [2021-12-14 19:29:38,655 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 20 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:38,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 1555 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 232 Invalid, 0 Unknown, 377 Unchecked, 0.1s Time] [2021-12-14 19:29:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-12-14 19:29:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 308. [2021-12-14 19:29:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 267 states have (on average 1.344569288389513) internal successors, (359), 297 states have internal predecessors, (359), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-14 19:29:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 376 transitions. [2021-12-14 19:29:38,660 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 376 transitions. Word has length 35 [2021-12-14 19:29:38,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:38,661 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 376 transitions. [2021-12-14 19:29:38,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 35 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) [2021-12-14 19:29:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 376 transitions. [2021-12-14 19:29:38,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:29:38,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:38,661 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:38,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:38,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:38,864 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:38,864 INFO L85 PathProgramCache]: Analyzing trace with hash 762522433, now seen corresponding path program 1 times [2021-12-14 19:29:38,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:38,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258453454] [2021-12-14 19:29:38,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:38,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 19:29:38,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:38,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258453454] [2021-12-14 19:29:38,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258453454] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:38,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:38,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:38,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839688795] [2021-12-14 19:29:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:38,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:38,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:38,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:38,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:38,881 INFO L87 Difference]: Start difference. First operand 308 states and 376 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) [2021-12-14 19:29:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:38,887 INFO L93 Difference]: Finished difference Result 278 states and 335 transitions. [2021-12-14 19:29:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:38,887 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 [2021-12-14 19:29:38,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:38,888 INFO L225 Difference]: With dead ends: 278 [2021-12-14 19:29:38,888 INFO L226 Difference]: Without dead ends: 278 [2021-12-14 19:29:38,889 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:29:38,890 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 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 [2021-12-14 19:29:38,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-14 19:29:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-12-14 19:29:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 239 states have (on average 1.3430962343096233) internal successors, (321), 268 states have internal predecessors, (321), 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) [2021-12-14 19:29:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 335 transitions. [2021-12-14 19:29:38,897 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 335 transitions. Word has length 35 [2021-12-14 19:29:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:38,897 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 335 transitions. [2021-12-14 19:29:38,897 INFO L471 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) [2021-12-14 19:29:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 335 transitions. [2021-12-14 19:29:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 19:29:38,898 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:38,898 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:38,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:29:38,898 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting sll_appendErr8REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash 444674194, now seen corresponding path program 1 times [2021-12-14 19:29:38,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:38,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389126863] [2021-12-14 19:29:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:38,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:29:38,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:38,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389126863] [2021-12-14 19:29:38,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389126863] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:38,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682926667] [2021-12-14 19:29:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:38,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:38,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:38,963 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) [2021-12-14 19:29:38,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 19:29:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:39,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:29:39,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:29:39,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:29:39,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682926667] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:39,187 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:39,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2021-12-14 19:29:39,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155183094] [2021-12-14 19:29:39,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:39,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:29:39,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:39,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:29:39,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:29:39,188 INFO L87 Difference]: Start difference. First operand 278 states and 335 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 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) [2021-12-14 19:29:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:39,255 INFO L93 Difference]: Finished difference Result 293 states and 343 transitions. [2021-12-14 19:29:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:29:39,255 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 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 [2021-12-14 19:29:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:39,256 INFO L225 Difference]: With dead ends: 293 [2021-12-14 19:29:39,256 INFO L226 Difference]: Without dead ends: 293 [2021-12-14 19:29:39,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:29:39,257 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 202 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:39,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 831 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-14 19:29:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 286. [2021-12-14 19:29:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 247 states have (on average 1.3319838056680162) internal successors, (329), 276 states have internal predecessors, (329), 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) [2021-12-14 19:29:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 343 transitions. [2021-12-14 19:29:39,261 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 343 transitions. Word has length 36 [2021-12-14 19:29:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:39,261 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 343 transitions. [2021-12-14 19:29:39,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 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) [2021-12-14 19:29:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 343 transitions. [2021-12-14 19:29:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 19:29:39,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:39,262 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:39,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-14 19:29:39,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 19:29:39,471 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:39,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash -308582730, now seen corresponding path program 1 times [2021-12-14 19:29:39,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:39,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68247283] [2021-12-14 19:29:39,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:39,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:39,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:39,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68247283] [2021-12-14 19:29:39,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68247283] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:39,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244533182] [2021-12-14 19:29:39,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:39,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:39,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:39,531 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) [2021-12-14 19:29:39,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 19:29:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:39,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:29:39,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:39,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:39,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244533182] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:39,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:39,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 11 [2021-12-14 19:29:39,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998527695] [2021-12-14 19:29:39,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:39,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:29:39,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:29:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:29:39,743 INFO L87 Difference]: Start difference. First operand 286 states and 343 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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) [2021-12-14 19:29:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:39,836 INFO L93 Difference]: Finished difference Result 359 states and 416 transitions. [2021-12-14 19:29:39,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:29:39,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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 [2021-12-14 19:29:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:39,838 INFO L225 Difference]: With dead ends: 359 [2021-12-14 19:29:39,838 INFO L226 Difference]: Without dead ends: 359 [2021-12-14 19:29:39,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:29:39,838 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 160 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:39,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 996 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:39,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-12-14 19:29:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 313. [2021-12-14 19:29:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 274 states have (on average 1.3467153284671534) internal successors, (369), 303 states have internal predecessors, (369), 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) [2021-12-14 19:29:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 383 transitions. [2021-12-14 19:29:39,849 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 383 transitions. Word has length 40 [2021-12-14 19:29:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:39,849 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 383 transitions. [2021-12-14 19:29:39,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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) [2021-12-14 19:29:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 383 transitions. [2021-12-14 19:29:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 19:29:39,850 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:39,850 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:39,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:40,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 19:29:40,063 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting sll_appendErr8REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785188, now seen corresponding path program 2 times [2021-12-14 19:29:40,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:40,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512025350] [2021-12-14 19:29:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:40,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 19:29:40,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:40,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512025350] [2021-12-14 19:29:40,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512025350] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:40,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286423926] [2021-12-14 19:29:40,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:29:40,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:40,163 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) [2021-12-14 19:29:40,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 19:29:40,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:29:40,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:29:40,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 19:29:40,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:40,285 INFO L388 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 [2021-12-14 19:29:40,346 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:29:40,347 INFO L388 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 [2021-12-14 19:29:40,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:40,370 INFO L388 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 [2021-12-14 19:29:40,389 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:29:40,390 INFO L388 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 [2021-12-14 19:29:40,439 INFO L354 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-14 19:29:40,439 INFO L388 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 [2021-12-14 19:29:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-14 19:29:40,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-14 19:29:41,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286423926] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:41,083 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:41,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2021-12-14 19:29:41,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699981031] [2021-12-14 19:29:41,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:41,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 19:29:41,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:41,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 19:29:41,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:29:41,084 INFO L87 Difference]: Start difference. First operand 313 states and 383 transitions. Second operand has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 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) [2021-12-14 19:29:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:41,345 INFO L93 Difference]: Finished difference Result 355 states and 428 transitions. [2021-12-14 19:29:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:29:41,346 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 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 44 [2021-12-14 19:29:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:41,347 INFO L225 Difference]: With dead ends: 355 [2021-12-14 19:29:41,347 INFO L226 Difference]: Without dead ends: 355 [2021-12-14 19:29:41,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:29:41,348 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 276 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:41,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 677 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 274 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2021-12-14 19:29:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-12-14 19:29:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 349. [2021-12-14 19:29:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 308 states have (on average 1.3376623376623376) internal successors, (412), 338 states have internal predecessors, (412), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-14 19:29:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 428 transitions. [2021-12-14 19:29:41,354 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 428 transitions. Word has length 44 [2021-12-14 19:29:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:41,354 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 428 transitions. [2021-12-14 19:29:41,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 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) [2021-12-14 19:29:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 428 transitions. [2021-12-14 19:29:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 19:29:41,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:41,355 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:41,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:41,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 19:29:41,576 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-14 19:29:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash 685803597, now seen corresponding path program 2 times [2021-12-14 19:29:41,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:41,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457596317] [2021-12-14 19:29:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:41,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 19:29:41,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:41,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457596317] [2021-12-14 19:29:41,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457596317] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:41,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693786486] [2021-12-14 19:29:41,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:29:41,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:41,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:41,820 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) [2021-12-14 19:29:41,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 19:29:41,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:29:41,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:29:41,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-14 19:29:41,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:42,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,140 INFO L388 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 [2021-12-14 19:29:42,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,143 INFO L388 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 [2021-12-14 19:29:42,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,253 INFO L388 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 [2021-12-14 19:29:42,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,256 INFO L388 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 [2021-12-14 19:29:42,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,392 INFO L388 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 [2021-12-14 19:29:42,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,403 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:29:42,403 INFO L388 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 [2021-12-14 19:29:42,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,502 INFO L388 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 [2021-12-14 19:29:42,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,506 INFO L388 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 [2021-12-14 19:29:42,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,607 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:29:42,607 INFO L388 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 [2021-12-14 19:29:42,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,625 INFO L388 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 [2021-12-14 19:29:42,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,655 INFO L388 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 [2021-12-14 19:29:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,660 INFO L388 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 [2021-12-14 19:29:42,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,722 INFO L388 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 [2021-12-14 19:29:42,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:42,725 INFO L388 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 [2021-12-14 19:29:42,752 INFO L388 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 [2021-12-14 19:29:42,753 INFO L388 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 [2021-12-14 19:29:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 19:29:42,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:42,775 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1009 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-14 19:29:42,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1009 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_#res#1.base| |v_sll_append_~new_last~0#1.base_13|))) is different from false [2021-12-14 19:29:42,809 WARN L838 $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_1009 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-14 19:29:42,830 WARN L838 $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_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (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_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-14 19:29:42,951 WARN L838 $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_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (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|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-14 19:29:43,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| 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|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-14 19:29:43,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| 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_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 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_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-14 19:29:43,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| 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_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 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_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (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_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-14 19:29:43,476 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| 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_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-14 19:29:43,807 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| 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_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (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_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-14 19:29:44,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-14 19:29:44,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-14 19:29:44,561 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (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_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_995))) (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 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |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|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-14 19:29:44,977 WARN L838 $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_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (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_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |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|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) is different from false [2021-12-14 19:29:45,809 WARN L838 $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_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (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_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) is different from false [2021-12-14 19:29:46,137 WARN L838 $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_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (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_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) is different from false [2021-12-14 19:29:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 28 not checked. [2021-12-14 19:29:49,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693786486] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:49,274 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:49,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 21] total 44 [2021-12-14 19:29:49,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630043309] [2021-12-14 19:29:49,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:49,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-14 19:29:49,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:49,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-14 19:29:49,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=632, Unknown=16, NotChecked=1072, Total=1892 [2021-12-14 19:29:49,276 INFO L87 Difference]: Start difference. First operand 349 states and 428 transitions. Second operand has 44 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 41 states have internal predecessors, (102), 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) [2021-12-14 19:29:51,284 WARN L838 $PredicateComparison]: unable to prove that (and (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_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (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_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) (= (select (select |c_#memory_$Pointer$.base| |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|) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (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)) is different from false [2021-12-14 19:29:53,289 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|))) (and (= (select .cse0 |c_sll_append_#in~head#1.offset|) 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_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse1 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse2 |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_1000))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (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_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) (= |c_sll_append_#in~head#1.offset| 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse3 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse3 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (= (select .cse0 0) 0) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|))) is different from false [2021-12-14 19:29:55,295 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (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_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |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|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-14 19:29:57,303 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (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_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_995))) (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 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |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|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |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)) is different from false [2021-12-14 19:29:59,306 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (= (select (select |c_#memory_$Pointer$.offset| |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)) is different from false [2021-12-14 19:30:01,312 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-14 19:30:03,315 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| 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_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (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_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (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_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |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)) is different from false [2021-12-14 19:30:05,322 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| 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_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |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|) 0) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-14 19:30:07,330 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| 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_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 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_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (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_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |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|) 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)) is different from false [2021-12-14 19:30:09,334 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |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_47| 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_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 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_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-14 19:30:11,336 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |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_47| 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|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false [2021-12-14 19:30:21,361 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (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_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (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|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |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)) is different from false