./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 ae007674 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-dev-ae00767 [2021-12-28 05:41:55,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:41:55,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:41:55,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:41:55,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:41:55,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:41:55,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:41:55,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:41:55,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:41:55,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:41:55,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:41:55,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:41:55,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:41:55,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:41:55,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:41:55,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:41:55,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:41:55,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:41:55,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:41:55,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:41:55,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:41:55,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:41:55,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:41:55,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:41:55,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:41:55,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:41:55,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:41:55,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:41:55,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:41:55,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:41:55,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:41:55,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:41:55,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:41:55,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:41:55,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:41:55,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:41:55,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:41:55,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:41:55,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:41:55,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:41:55,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:41:55,738 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-28 05:41:55,757 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:41:55,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:41:55,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:41:55,758 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:41:55,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:41:55,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:41:55,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:41:55,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:41:55,760 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:41:55,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:41:55,760 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:41:55,760 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:41:55,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:41:55,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:41:55,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:41:55,761 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:41:55,761 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:41:55,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:41:55,761 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:41:55,762 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:41:55,762 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:41:55,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:41:55,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:41:55,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:41:55,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:55,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:41:55,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:41:55,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:41:55,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:41:55,771 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-28 05:41:56,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:41:56,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:41:56,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:41:56,082 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:41:56,085 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:41:56,086 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-28 05:41:56,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1782d2a53/b0acab3293bd49cb864489bb708d6101/FLAG9e31acfb0 [2021-12-28 05:41:56,626 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:41:56,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2021-12-28 05:41:56,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1782d2a53/b0acab3293bd49cb864489bb708d6101/FLAG9e31acfb0 [2021-12-28 05:41:56,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1782d2a53/b0acab3293bd49cb864489bb708d6101 [2021-12-28 05:41:56,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:41:56,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:41:56,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:56,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:41:56,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:41:56,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:41:56" (1/1) ... [2021-12-28 05:41:56,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619d3833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:56, skipping insertion in model container [2021-12-28 05:41:56,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:41:56" (1/1) ... [2021-12-28 05:41:56,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:41:57,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:41:57,365 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-28 05:41:57,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:57,383 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:41:57,449 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-28 05:41:57,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:57,488 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:41:57,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57 WrapperNode [2021-12-28 05:41:57,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:57,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:57,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:41:57,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:41:57,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (1/1) ... [2021-12-28 05:41:57,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (1/1) ... [2021-12-28 05:41:57,558 INFO L137 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2021-12-28 05:41:57,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:57,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:41:57,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:41:57,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:41:57,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (1/1) ... [2021-12-28 05:41:57,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (1/1) ... [2021-12-28 05:41:57,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (1/1) ... [2021-12-28 05:41:57,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (1/1) ... [2021-12-28 05:41:57,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (1/1) ... [2021-12-28 05:41:57,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (1/1) ... [2021-12-28 05:41:57,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (1/1) ... [2021-12-28 05:41:57,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:41:57,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:41:57,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:41:57,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:41:57,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (1/1) ... [2021-12-28 05:41:57,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:57,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:57,632 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-28 05:41:57,634 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-28 05:41:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-28 05:41:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-28 05:41:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:41:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:41:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 05:41:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:41:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2021-12-28 05:41:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2021-12-28 05:41:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:41:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:41:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:41:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:41:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:41:57,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:41:57,759 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:41:57,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:41:57,819 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-28 05:41:58,104 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:41:58,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:41:58,111 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-28 05:41:58,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:58 BoogieIcfgContainer [2021-12-28 05:41:58,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:41:58,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:41:58,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:41:58,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:41:58,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:41:56" (1/3) ... [2021-12-28 05:41:58,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d181aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:58, skipping insertion in model container [2021-12-28 05:41:58,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:57" (2/3) ... [2021-12-28 05:41:58,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d181aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:58, skipping insertion in model container [2021-12-28 05:41:58,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:58" (3/3) ... [2021-12-28 05:41:58,119 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2021-12-28 05:41:58,123 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:41:58,124 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-12-28 05:41:58,159 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:41:58,164 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-28 05:41:58,164 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-12-28 05:41:58,198 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-28 05:41:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 05:41:58,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:58,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:58,215 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-28 05:41:58,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:58,224 INFO L85 PathProgramCache]: Analyzing trace with hash -46006015, now seen corresponding path program 1 times [2021-12-28 05:41:58,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:58,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981505703] [2021-12-28 05:41:58,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:58,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:58,469 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-28 05:41:58,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:58,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981505703] [2021-12-28 05:41:58,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981505703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:58,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:58,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:58,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118845175] [2021-12-28 05:41:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:58,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:58,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:58,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:58,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:58,512 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-28 05:41:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:58,590 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2021-12-28 05:41:58,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:58,598 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-28 05:41:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:58,606 INFO L225 Difference]: With dead ends: 128 [2021-12-28 05:41:58,608 INFO L226 Difference]: Without dead ends: 122 [2021-12-28 05:41:58,609 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-28 05:41:58,612 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-28 05:41:58,614 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-28 05:41:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-28 05:41:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2021-12-28 05:41:58,649 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-28 05:41:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2021-12-28 05:41:58,653 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 10 [2021-12-28 05:41:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:58,654 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2021-12-28 05:41:58,654 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-28 05:41:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2021-12-28 05:41:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-28 05:41:58,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:58,660 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:58,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:41:58,660 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-28 05:41:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash 244152622, now seen corresponding path program 1 times [2021-12-28 05:41:58,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:58,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680245054] [2021-12-28 05:41:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:58,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:58,737 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-28 05:41:58,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:58,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680245054] [2021-12-28 05:41:58,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680245054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:58,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:58,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:58,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320080354] [2021-12-28 05:41:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:58,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:58,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:58,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:58,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:58,743 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-28 05:41:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:58,839 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2021-12-28 05:41:58,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:58,840 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-28 05:41:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:58,843 INFO L225 Difference]: With dead ends: 151 [2021-12-28 05:41:58,843 INFO L226 Difference]: Without dead ends: 151 [2021-12-28 05:41:58,843 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-28 05:41:58,844 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:58,845 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-28 05:41:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-28 05:41:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2021-12-28 05:41:58,855 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-28 05:41:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2021-12-28 05:41:58,857 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 13 [2021-12-28 05:41:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:58,857 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2021-12-28 05:41:58,858 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-28 05:41:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2021-12-28 05:41:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-28 05:41:58,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:58,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:58,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:41:58,859 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-28 05:41:58,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:58,860 INFO L85 PathProgramCache]: Analyzing trace with hash 244152621, now seen corresponding path program 1 times [2021-12-28 05:41:58,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:58,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972023703] [2021-12-28 05:41:58,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:58,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:58,922 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-28 05:41:58,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:58,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972023703] [2021-12-28 05:41:58,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972023703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:58,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:58,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:58,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420104012] [2021-12-28 05:41:58,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:58,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:58,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:58,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:58,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:58,926 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-28 05:41:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:59,048 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2021-12-28 05:41:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:59,049 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-28 05:41:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:59,050 INFO L225 Difference]: With dead ends: 150 [2021-12-28 05:41:59,051 INFO L226 Difference]: Without dead ends: 150 [2021-12-28 05:41:59,051 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-28 05:41:59,052 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-28 05:41:59,053 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-28 05:41:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-28 05:41:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 114. [2021-12-28 05:41:59,060 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-28 05:41:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2021-12-28 05:41:59,062 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2021-12-28 05:41:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:59,062 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2021-12-28 05:41:59,063 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-28 05:41:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2021-12-28 05:41:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:41:59,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:59,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:59,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:41:59,064 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-28 05:41:59,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253985, now seen corresponding path program 1 times [2021-12-28 05:41:59,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:59,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14809428] [2021-12-28 05:41:59,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:59,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:59,108 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-28 05:41:59,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:59,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14809428] [2021-12-28 05:41:59,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14809428] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:59,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:59,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:59,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513454228] [2021-12-28 05:41:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:59,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:59,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:59,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:59,110 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:59,178 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2021-12-28 05:41:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-28 05:41:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:59,186 INFO L225 Difference]: With dead ends: 112 [2021-12-28 05:41:59,187 INFO L226 Difference]: Without dead ends: 112 [2021-12-28 05:41:59,188 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-28 05:41:59,189 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:59,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 162 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:59,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-28 05:41:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-12-28 05:41:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.7183098591549295) internal successors, (122), 108 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:41:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2021-12-28 05:41:59,205 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2021-12-28 05:41:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:59,206 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2021-12-28 05:41:59,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2021-12-28 05:41:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:41:59,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:59,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:59,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:41:59,212 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-28 05:41:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253984, now seen corresponding path program 1 times [2021-12-28 05:41:59,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:59,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059845844] [2021-12-28 05:41:59,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:59,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:59,285 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-28 05:41:59,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:59,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059845844] [2021-12-28 05:41:59,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059845844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:59,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:59,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:41:59,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927791797] [2021-12-28 05:41:59,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:59,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:59,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:59,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:59,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:59,288 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:59,370 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2021-12-28 05:41:59,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:59,371 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-28 05:41:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:59,373 INFO L225 Difference]: With dead ends: 213 [2021-12-28 05:41:59,373 INFO L226 Difference]: Without dead ends: 213 [2021-12-28 05:41:59,373 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-28 05:41:59,375 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 160 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:59,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 892 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:59,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-28 05:41:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 139. [2021-12-28 05:41:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 134 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:41:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 169 transitions. [2021-12-28 05:41:59,384 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 169 transitions. Word has length 14 [2021-12-28 05:41:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:59,384 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 169 transitions. [2021-12-28 05:41:59,384 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-28 05:41:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 169 transitions. [2021-12-28 05:41:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:41:59,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:59,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:59,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:41:59,386 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-28 05:41:59,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash -790832604, now seen corresponding path program 1 times [2021-12-28 05:41:59,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:59,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213270236] [2021-12-28 05:41:59,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:59,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:59,427 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-28 05:41:59,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:59,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213270236] [2021-12-28 05:41:59,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213270236] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:59,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899371830] [2021-12-28 05:41:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:59,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:59,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:59,431 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-28 05:41:59,441 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-28 05:41:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:59,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 05:41:59,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:59,644 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-28 05:41:59,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:59,694 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-28 05:41:59,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899371830] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:59,697 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:59,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-28 05:41:59,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581032125] [2021-12-28 05:41:59,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:59,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:41:59,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:41:59,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:41:59,699 INFO L87 Difference]: Start difference. First operand 139 states and 169 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:59,775 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2021-12-28 05:41:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:59,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-28 05:41:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:59,776 INFO L225 Difference]: With dead ends: 192 [2021-12-28 05:41:59,776 INFO L226 Difference]: Without dead ends: 192 [2021-12-28 05:41:59,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:41:59,781 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 91 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:59,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 517 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-12-28 05:41:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2021-12-28 05:41:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 149 states have internal predecessors, (185), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:41:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2021-12-28 05:41:59,790 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2021-12-28 05:41:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:59,791 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2021-12-28 05:41:59,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2021-12-28 05:41:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:41:59,792 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:59,792 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-28 05:41:59,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 05:42:00,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 05:42:00,004 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-28 05:42:00,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:00,004 INFO L85 PathProgramCache]: Analyzing trace with hash -924446423, now seen corresponding path program 1 times [2021-12-28 05:42:00,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:00,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410214573] [2021-12-28 05:42:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:00,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:00,110 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-28 05:42:00,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:00,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410214573] [2021-12-28 05:42:00,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410214573] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:00,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932114879] [2021-12-28 05:42:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:00,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:00,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:00,113 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-28 05:42:00,114 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-28 05:42:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:00,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:42:00,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:00,254 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-28 05:42:00,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:00,335 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-28 05:42:00,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932114879] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:00,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:42:00,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-28 05:42:00,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382496868] [2021-12-28 05:42:00,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:00,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:42:00,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:00,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:42:00,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:42:00,338 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:00,445 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2021-12-28 05:42:00,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:42:00,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-28 05:42:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:00,447 INFO L225 Difference]: With dead ends: 238 [2021-12-28 05:42:00,447 INFO L226 Difference]: Without dead ends: 238 [2021-12-28 05:42:00,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:42:00,448 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 291 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:00,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 1266 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:42:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-28 05:42:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 164. [2021-12-28 05:42:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 120 states have (on average 1.6083333333333334) internal successors, (193), 157 states have internal predecessors, (193), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:42:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2021-12-28 05:42:00,470 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 18 [2021-12-28 05:42:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:00,470 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2021-12-28 05:42:00,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2021-12-28 05:42:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:42:00,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:00,474 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:42:00,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:42:00,699 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,SelfDestructingSolverStorable6 [2021-12-28 05:42:00,700 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-28 05:42:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash 760370116, now seen corresponding path program 2 times [2021-12-28 05:42:00,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:00,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038209221] [2021-12-28 05:42:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:00,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-28 05:42:00,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:00,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038209221] [2021-12-28 05:42:00,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038209221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:42:00,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:42:00,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:42:00,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075253632] [2021-12-28 05:42:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:42:00,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:42:00,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:00,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:42:00,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:42:00,771 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:00,807 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2021-12-28 05:42:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:42:00,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 05:42:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:00,809 INFO L225 Difference]: With dead ends: 182 [2021-12-28 05:42:00,809 INFO L226 Difference]: Without dead ends: 182 [2021-12-28 05:42:00,809 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-28 05:42:00,810 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 162 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:00,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 641 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:42:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-28 05:42:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-12-28 05:42:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.603305785123967) internal successors, (194), 158 states have internal predecessors, (194), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:42:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2021-12-28 05:42:00,815 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 26 [2021-12-28 05:42:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:00,815 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2021-12-28 05:42:00,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2021-12-28 05:42:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:42:00,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:00,816 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-28 05:42:00,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:42:00,817 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-28 05:42:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676229, now seen corresponding path program 2 times [2021-12-28 05:42:00,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:00,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847119334] [2021-12-28 05:42:00,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:00,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 05:42:00,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:00,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847119334] [2021-12-28 05:42:00,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847119334] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:00,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775964464] [2021-12-28 05:42:00,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 05:42:00,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:00,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:00,958 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-28 05:42:00,985 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-28 05:42:01,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 05:42:01,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 05:42:01,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 05:42:01,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:01,105 INFO L387 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-28 05:42:01,112 INFO L387 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-28 05:42:01,166 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:42:01,166 INFO L387 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-28 05:42:01,173 INFO L387 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-28 05:42:01,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:01,229 INFO L387 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-28 05:42:01,237 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:42:01,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:42:01,276 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:42:01,277 INFO L387 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-28 05:42:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-28 05:42:01,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:42:02,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775964464] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:02,305 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:42:02,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2021-12-28 05:42:02,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680918274] [2021-12-28 05:42:02,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:02,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:42:02,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:02,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:42:02,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:42:02,308 INFO L87 Difference]: Start difference. First operand 165 states and 202 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:02,349 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2021-12-28 05:42:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:42:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 05:42:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:02,351 INFO L225 Difference]: With dead ends: 163 [2021-12-28 05:42:02,351 INFO L226 Difference]: Without dead ends: 163 [2021-12-28 05:42:02,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:42:02,354 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 171 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:02,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 272 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 55 Unchecked, 0.0s Time] [2021-12-28 05:42:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-28 05:42:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-28 05:42:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 121 states have (on average 1.5702479338842976) internal successors, (190), 156 states have internal predecessors, (190), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:42:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2021-12-28 05:42:02,360 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 26 [2021-12-28 05:42:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:02,362 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2021-12-28 05:42:02,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:02,362 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2021-12-28 05:42:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 05:42:02,366 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:02,366 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-28 05:42:02,391 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-28 05:42:02,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:02,579 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-28 05:42:02,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash 320066679, now seen corresponding path program 1 times [2021-12-28 05:42:02,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:02,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014900710] [2021-12-28 05:42:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:02,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:02,626 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-28 05:42:02,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:02,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014900710] [2021-12-28 05:42:02,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014900710] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:42:02,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:42:02,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:42:02,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558086333] [2021-12-28 05:42:02,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:42:02,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:42:02,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:02,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:42:02,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:42:02,629 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:02,717 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2021-12-28 05:42:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:42:02,718 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-28 05:42:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:02,719 INFO L225 Difference]: With dead ends: 162 [2021-12-28 05:42:02,719 INFO L226 Difference]: Without dead ends: 162 [2021-12-28 05:42:02,719 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-28 05:42:02,720 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 83 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-28 05:42:02,720 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-28 05:42:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-28 05:42:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-12-28 05:42:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 121 states have (on average 1.5537190082644627) internal successors, (188), 155 states have internal predecessors, (188), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:42:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2021-12-28 05:42:02,724 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 31 [2021-12-28 05:42:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:02,725 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2021-12-28 05:42:02,725 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-28 05:42:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2021-12-28 05:42:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 05:42:02,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:02,726 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-28 05:42:02,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:42:02,726 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-28 05:42:02,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash 320066680, now seen corresponding path program 1 times [2021-12-28 05:42:02,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:02,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093132604] [2021-12-28 05:42:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:02,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:02,792 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-28 05:42:02,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:02,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093132604] [2021-12-28 05:42:02,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093132604] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:42:02,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:42:02,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:42:02,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847104765] [2021-12-28 05:42:02,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:42:02,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:42:02,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:02,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:42:02,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:42:02,794 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:02,875 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2021-12-28 05:42:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:42:02,876 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-28 05:42:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:02,877 INFO L225 Difference]: With dead ends: 161 [2021-12-28 05:42:02,877 INFO L226 Difference]: Without dead ends: 161 [2021-12-28 05:42:02,877 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-28 05:42:02,878 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.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:02,878 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.1s Time] [2021-12-28 05:42:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-28 05:42:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-12-28 05:42:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 121 states have (on average 1.537190082644628) internal successors, (186), 154 states have internal predecessors, (186), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:42:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2021-12-28 05:42:02,882 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 31 [2021-12-28 05:42:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:02,882 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2021-12-28 05:42:02,883 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-28 05:42:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2021-12-28 05:42:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-28 05:42:02,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:02,884 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-28 05:42:02,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:42:02,884 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-28 05:42:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132480, now seen corresponding path program 1 times [2021-12-28 05:42:02,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:02,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220344836] [2021-12-28 05:42:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:02,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:03,028 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-28 05:42:03,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:03,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220344836] [2021-12-28 05:42:03,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220344836] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:03,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819581301] [2021-12-28 05:42:03,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:03,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:03,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:03,032 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-28 05:42:03,059 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-28 05:42:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:03,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-28 05:42:03,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:03,146 INFO L387 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-28 05:42:03,187 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:42:03,187 INFO L387 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-28 05:42:03,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:03,221 INFO L387 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-28 05:42:03,248 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:42:03,248 INFO L387 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-28 05:42:03,315 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-28 05:42:03,315 INFO L387 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-28 05:42:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 05:42:03,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 05:42:03,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819581301] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:03,888 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:42:03,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2021-12-28 05:42:03,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069637433] [2021-12-28 05:42:03,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:03,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-28 05:42:03,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:03,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-28 05:42:03,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-12-28 05:42:03,890 INFO L87 Difference]: Start difference. First operand 161 states and 194 transitions. Second operand has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:04,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:04,138 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2021-12-28 05:42:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:42:04,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-28 05:42:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:04,140 INFO L225 Difference]: With dead ends: 222 [2021-12-28 05:42:04,140 INFO L226 Difference]: Without dead ends: 222 [2021-12-28 05:42:04,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-28 05:42:04,141 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 283 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:04,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 782 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 341 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2021-12-28 05:42:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-28 05:42:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2021-12-28 05:42:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 170 states have (on average 1.4764705882352942) internal successors, (251), 205 states have internal predecessors, (251), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-28 05:42:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 265 transitions. [2021-12-28 05:42:04,149 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 265 transitions. Word has length 32 [2021-12-28 05:42:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:04,149 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 265 transitions. [2021-12-28 05:42:04,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2021-12-28 05:42:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-28 05:42:04,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:04,150 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-28 05:42:04,179 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-28 05:42:04,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:04,363 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-28 05:42:04,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132481, now seen corresponding path program 1 times [2021-12-28 05:42:04,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:04,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277359537] [2021-12-28 05:42:04,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:04,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:04,514 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-28 05:42:04,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:04,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277359537] [2021-12-28 05:42:04,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277359537] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:04,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922729702] [2021-12-28 05:42:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:04,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:04,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:04,516 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-28 05:42:04,518 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-28 05:42:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:04,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 05:42:04,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:04,630 INFO L387 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-28 05:42:04,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:04,694 INFO L387 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-28 05:42:04,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:04,722 INFO L387 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-28 05:42:04,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:04,777 INFO L387 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-28 05:42:04,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:04,814 INFO L387 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-28 05:42:04,874 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-28 05:42:04,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:06,032 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-28 05:42:06,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922729702] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:06,033 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:42:06,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-12-28 05:42:06,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7565133] [2021-12-28 05:42:06,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:06,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 05:42:06,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:06,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 05:42:06,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:42:06,035 INFO L87 Difference]: Start difference. First operand 213 states and 265 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:06,154 INFO L93 Difference]: Finished difference Result 219 states and 263 transitions. [2021-12-28 05:42:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:42:06,155 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-28 05:42:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:06,156 INFO L225 Difference]: With dead ends: 219 [2021-12-28 05:42:06,156 INFO L226 Difference]: Without dead ends: 219 [2021-12-28 05:42:06,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:42:06,157 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 68 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:06,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 483 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 97 Unchecked, 0.1s Time] [2021-12-28 05:42:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-28 05:42:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2021-12-28 05:42:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 170 states have (on average 1.4529411764705882) internal successors, (247), 204 states have internal predecessors, (247), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-28 05:42:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 261 transitions. [2021-12-28 05:42:06,163 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 261 transitions. Word has length 32 [2021-12-28 05:42:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:06,164 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 261 transitions. [2021-12-28 05:42:06,164 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-28 05:42:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2021-12-28 05:42:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 05:42:06,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:06,165 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-28 05:42:06,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-28 05:42:06,376 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,SelfDestructingSolverStorable12 [2021-12-28 05:42:06,377 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-28 05:42:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash 60922559, now seen corresponding path program 1 times [2021-12-28 05:42:06,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:06,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695099271] [2021-12-28 05:42:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:06,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:06,691 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-28 05:42:06,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:06,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695099271] [2021-12-28 05:42:06,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695099271] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:06,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51794705] [2021-12-28 05:42:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:06,692 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:06,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:06,696 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-28 05:42:06,697 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-28 05:42:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:06,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-28 05:42:06,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:07,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,071 INFO L387 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-28 05:42:07,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,077 INFO L387 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-28 05:42:07,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,228 INFO L387 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-28 05:42:07,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,233 INFO L387 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-28 05:42:07,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,424 INFO L387 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-28 05:42:07,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,435 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-28 05:42:07,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-12-28 05:42:07,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,558 INFO L387 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-28 05:42:07,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,576 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:42:07,577 INFO L387 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-28 05:42:07,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,637 INFO L387 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-28 05:42:07,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,645 INFO L387 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-28 05:42:07,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,727 INFO L387 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-28 05:42:07,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:07,732 INFO L387 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-28 05:42:07,761 INFO L387 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-28 05:42:07,764 INFO L387 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-28 05:42:07,777 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-28 05:42:07,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:07,799 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-28 05:42:07,808 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-28 05:42:07,817 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-28 05:42:07,878 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) is different from false [2021-12-28 05:42:07,930 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:07,954 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:07,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:08,122 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:08,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:08,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:08,672 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:09,182 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:09,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:10,229 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-28 05:42:10,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51794705] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:10,230 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:42:10,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 41 [2021-12-28 05:42:10,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805990532] [2021-12-28 05:42:10,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:10,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-28 05:42:10,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-28 05:42:10,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=632, Unknown=13, NotChecked=832, Total=1640 [2021-12-28 05:42:10,232 INFO L87 Difference]: Start difference. First operand 212 states and 261 transitions. Second operand has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:12,265 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2021-12-28 05:42:12,288 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|))) (and (= |c_sll_append_#in~head#1.offset| 0) (= (select .cse0 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse1 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse1 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse3 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse3 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0))) is different from false [2021-12-28 05:42:12,392 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-28 05:42:12,427 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-28 05:42:14,435 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-28 05:42:16,440 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-28 05:42:18,445 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false [2021-12-28 05:42:20,448 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-28 05:42:22,453 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false [2021-12-28 05:42:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:23,940 INFO L93 Difference]: Finished difference Result 264 states and 321 transitions. [2021-12-28 05:42:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-28 05:42:23,941 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-28 05:42:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:23,942 INFO L225 Difference]: With dead ends: 264 [2021-12-28 05:42:23,942 INFO L226 Difference]: Without dead ends: 264 [2021-12-28 05:42:23,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=243, Invalid=1083, Unknown=22, NotChecked=1958, Total=3306 [2021-12-28 05:42:23,944 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 26 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 550 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:23,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 2241 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 334 Invalid, 0 Unknown, 550 Unchecked, 0.2s Time] [2021-12-28 05:42:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-12-28 05:42:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 243. [2021-12-28 05:42:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.3969849246231156) internal successors, (278), 234 states have internal predecessors, (278), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-28 05:42:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 297 transitions. [2021-12-28 05:42:23,951 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 297 transitions. Word has length 35 [2021-12-28 05:42:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:23,951 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 297 transitions. [2021-12-28 05:42:23,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 297 transitions. [2021-12-28 05:42:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 05:42:23,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:23,952 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-28 05:42:23,975 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-28 05:42:24,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:24,153 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-28 05:42:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash 762522433, now seen corresponding path program 1 times [2021-12-28 05:42:24,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:24,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324306005] [2021-12-28 05:42:24,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:24,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:24,177 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-28 05:42:24,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:24,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324306005] [2021-12-28 05:42:24,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324306005] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:42:24,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:42:24,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:42:24,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729844552] [2021-12-28 05:42:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:42:24,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:42:24,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:24,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:42:24,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:42:24,179 INFO L87 Difference]: Start difference. First operand 243 states and 297 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:24,187 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2021-12-28 05:42:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:42:24,187 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-28 05:42:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:24,189 INFO L225 Difference]: With dead ends: 247 [2021-12-28 05:42:24,189 INFO L226 Difference]: Without dead ends: 247 [2021-12-28 05:42:24,190 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-28 05:42:24,191 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:24,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:42:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-28 05:42:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-12-28 05:42:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 204 states have (on average 1.3823529411764706) internal successors, (282), 238 states have internal predecessors, (282), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-28 05:42:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 298 transitions. [2021-12-28 05:42:24,199 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 298 transitions. Word has length 35 [2021-12-28 05:42:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:24,199 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 298 transitions. [2021-12-28 05:42:24,200 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-28 05:42:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 298 transitions. [2021-12-28 05:42:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 05:42:24,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:24,200 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-28 05:42:24,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:42:24,201 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-28 05:42:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash 444674194, now seen corresponding path program 1 times [2021-12-28 05:42:24,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:24,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065501101] [2021-12-28 05:42:24,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:24,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:24,270 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-28 05:42:24,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:24,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065501101] [2021-12-28 05:42:24,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065501101] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456939040] [2021-12-28 05:42:24,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:24,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:24,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:24,276 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-28 05:42:24,277 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-28 05:42:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:24,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 05:42:24,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:24,425 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-28 05:42:24,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:24,507 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-28 05:42:24,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456939040] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:24,507 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:42:24,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-28 05:42:24,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615271911] [2021-12-28 05:42:24,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:24,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:42:24,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:24,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:42:24,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:42:24,509 INFO L87 Difference]: Start difference. First operand 247 states and 298 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:24,581 INFO L93 Difference]: Finished difference Result 263 states and 306 transitions. [2021-12-28 05:42:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:42:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-28 05:42:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:24,583 INFO L225 Difference]: With dead ends: 263 [2021-12-28 05:42:24,583 INFO L226 Difference]: Without dead ends: 263 [2021-12-28 05:42:24,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:42:24,584 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 197 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:24,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 905 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:42:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-12-28 05:42:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 255. [2021-12-28 05:42:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 212 states have (on average 1.3679245283018868) internal successors, (290), 246 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-28 05:42:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 306 transitions. [2021-12-28 05:42:24,591 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 306 transitions. Word has length 36 [2021-12-28 05:42:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:24,591 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 306 transitions. [2021-12-28 05:42:24,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 306 transitions. [2021-12-28 05:42:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-28 05:42:24,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:24,592 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-28 05:42:24,621 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-28 05:42:24,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:24,808 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-28 05:42:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -308582730, now seen corresponding path program 1 times [2021-12-28 05:42:24,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:24,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361082719] [2021-12-28 05:42:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:24,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:24,883 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-28 05:42:24,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:24,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361082719] [2021-12-28 05:42:24,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361082719] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:24,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658651441] [2021-12-28 05:42:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:24,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:24,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:24,896 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-28 05:42:24,897 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-28 05:42:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:24,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-28 05:42:25,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:25,069 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-28 05:42:25,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:25,153 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-28 05:42:25,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658651441] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:25,154 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:42:25,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2021-12-28 05:42:25,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142734754] [2021-12-28 05:42:25,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:25,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:42:25,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:25,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:42:25,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:42:25,156 INFO L87 Difference]: Start difference. First operand 255 states and 306 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:25,278 INFO L93 Difference]: Finished difference Result 369 states and 428 transitions. [2021-12-28 05:42:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:42:25,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-28 05:42:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:25,280 INFO L225 Difference]: With dead ends: 369 [2021-12-28 05:42:25,280 INFO L226 Difference]: Without dead ends: 369 [2021-12-28 05:42:25,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:42:25,281 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 162 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:25,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 1160 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:42:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-12-28 05:42:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 318. [2021-12-28 05:42:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 274 states have (on average 1.3722627737226278) internal successors, (376), 308 states have internal predecessors, (376), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-28 05:42:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 390 transitions. [2021-12-28 05:42:25,289 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 390 transitions. Word has length 40 [2021-12-28 05:42:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:25,289 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 390 transitions. [2021-12-28 05:42:25,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 390 transitions. [2021-12-28 05:42:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:42:25,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:25,290 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-28 05:42:25,317 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-28 05:42:25,505 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,SelfDestructingSolverStorable16 [2021-12-28 05:42:25,505 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-28 05:42:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785188, now seen corresponding path program 2 times [2021-12-28 05:42:25,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:25,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733147623] [2021-12-28 05:42:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:25,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:25,662 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-28 05:42:25,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:25,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733147623] [2021-12-28 05:42:25,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733147623] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:25,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378146547] [2021-12-28 05:42:25,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 05:42:25,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:25,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:25,663 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-28 05:42:25,664 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-28 05:42:25,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 05:42:25,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 05:42:25,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-28 05:42:25,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:25,782 INFO L387 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-28 05:42:25,832 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:42:25,832 INFO L387 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-28 05:42:25,858 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:42:25,858 INFO L387 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-28 05:42:25,936 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-28 05:42:25,936 INFO L387 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-28 05:42:26,024 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-28 05:42:26,025 INFO L387 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-28 05:42:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-28 05:42:26,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:42:26,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378146547] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:42:26,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 05:42:26,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2021-12-28 05:42:26,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428886857] [2021-12-28 05:42:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:42:26,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:42:26,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:26,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:42:26,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:42:26,162 INFO L87 Difference]: Start difference. First operand 318 states and 390 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:26,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:26,256 INFO L93 Difference]: Finished difference Result 342 states and 414 transitions. [2021-12-28 05:42:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:42:26,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-28 05:42:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:26,258 INFO L225 Difference]: With dead ends: 342 [2021-12-28 05:42:26,258 INFO L226 Difference]: Without dead ends: 342 [2021-12-28 05:42:26,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:42:26,259 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 164 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:26,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 328 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2021-12-28 05:42:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-12-28 05:42:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 315. [2021-12-28 05:42:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 274 states have (on average 1.354014598540146) internal successors, (371), 305 states have internal predecessors, (371), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-28 05:42:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 385 transitions. [2021-12-28 05:42:26,267 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 385 transitions. Word has length 44 [2021-12-28 05:42:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:26,267 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 385 transitions. [2021-12-28 05:42:26,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 385 transitions. [2021-12-28 05:42:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:42:26,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:26,268 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-28 05:42:26,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-28 05:42:26,483 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,SelfDestructingSolverStorable17 [2021-12-28 05:42:26,483 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting sll_appendErr9REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-28 05:42:26,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785189, now seen corresponding path program 1 times [2021-12-28 05:42:26,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:26,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770455548] [2021-12-28 05:42:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:26,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 05:42:26,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:26,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770455548] [2021-12-28 05:42:26,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770455548] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:26,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003080798] [2021-12-28 05:42:26,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:26,604 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:26,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:26,605 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-28 05:42:26,606 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-28 05:42:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:26,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 05:42:26,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:26,717 INFO L387 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-28 05:42:26,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:26,864 INFO L387 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-28 05:42:26,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:26,899 INFO L387 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-28 05:42:26,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:26,931 INFO L387 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-28 05:42:26,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:26,963 INFO L387 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-28 05:42:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 05:42:27,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 05:42:28,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003080798] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:28,726 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:42:28,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2021-12-28 05:42:28,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985362545] [2021-12-28 05:42:28,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:28,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:42:28,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:42:28,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:42:28,731 INFO L87 Difference]: Start difference. First operand 315 states and 385 transitions. Second operand has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:28,879 INFO L93 Difference]: Finished difference Result 339 states and 409 transitions. [2021-12-28 05:42:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:42:28,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-28 05:42:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:28,882 INFO L225 Difference]: With dead ends: 339 [2021-12-28 05:42:28,882 INFO L226 Difference]: Without dead ends: 339 [2021-12-28 05:42:28,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:42:28,884 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 176 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:28,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 357 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 190 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2021-12-28 05:42:28,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-12-28 05:42:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 256. [2021-12-28 05:42:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 221 states have (on average 1.3529411764705883) internal successors, (299), 247 states have internal predecessors, (299), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-28 05:42:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 309 transitions. [2021-12-28 05:42:28,894 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 309 transitions. Word has length 44 [2021-12-28 05:42:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:28,894 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 309 transitions. [2021-12-28 05:42:28,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 309 transitions. [2021-12-28 05:42:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:42:28,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:28,896 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-28 05:42:28,924 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-28 05:42:29,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:29,113 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-28 05:42:29,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash 685803597, now seen corresponding path program 2 times [2021-12-28 05:42:29,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:29,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768393196] [2021-12-28 05:42:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:29,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:29,387 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-28 05:42:29,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:29,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768393196] [2021-12-28 05:42:29,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768393196] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:29,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967755477] [2021-12-28 05:42:29,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 05:42:29,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:29,389 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-28 05:42:29,390 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-28 05:42:29,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 05:42:29,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 05:42:29,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-28 05:42:29,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:29,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:29,729 INFO L387 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-28 05:42:29,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:29,735 INFO L387 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-28 05:42:29,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:29,798 INFO L387 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-28 05:42:29,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:29,806 INFO L387 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-28 05:42:29,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:29,857 INFO L387 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-28 05:42:29,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:29,867 INFO L387 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-28 05:42:29,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:29,931 INFO L387 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-28 05:42:29,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:29,934 INFO L387 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-28 05:42:29,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:29,992 INFO L387 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-28 05:42:30,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:30,006 INFO L387 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-28 05:42:30,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:30,025 INFO L387 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-28 05:42:30,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:30,031 INFO L387 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-28 05:42:30,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:30,096 INFO L387 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-28 05:42:30,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:30,101 INFO L387 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-28 05:42:30,124 INFO L387 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-28 05:42:30,126 INFO L387 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-28 05:42:30,133 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-28 05:42:30,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:30,152 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-28 05:42:30,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (<= |v_sll_append_~new_last~0#1.base_13| |c_sll_append_node_create_with_sublist_#res#1.base|)))) is different from false [2021-12-28 05:42:30,188 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_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:30,210 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_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:30,353 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_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:30,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:30,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) is different from false [2021-12-28 05:42:33,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:33,533 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) is different from false [2021-12-28 05:42:36,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) is different from false [2021-12-28 05:42:36,695 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= 0 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))))) is different from false [2021-12-28 05:42:37,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:40,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:41,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) is different from false [2021-12-28 05:42:44,478 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-28 05:42:44,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967755477] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:44,479 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:42:44,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 36 [2021-12-28 05:42:44,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734523009] [2021-12-28 05:42:44,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:44,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-28 05:42:44,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-28 05:42:44,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=395, Unknown=14, NotChecked=742, Total=1260 [2021-12-28 05:42:44,480 INFO L87 Difference]: Start difference. First operand 256 states and 309 transitions. Second operand has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:46,489 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2021-12-28 05:42:48,493 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_sll_append_#in~head#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) is different from false [2021-12-28 05:42:50,499 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|))))) is different from false [2021-12-28 05:42:52,559 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-28 05:42:54,563 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-28 05:42:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:54,835 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2021-12-28 05:42:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:42:54,836 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-28 05:42:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:54,837 INFO L225 Difference]: With dead ends: 308 [2021-12-28 05:42:54,838 INFO L226 Difference]: Without dead ends: 308 [2021-12-28 05:42:54,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=164, Invalid=543, Unknown=19, NotChecked=1254, Total=1980 [2021-12-28 05:42:54,839 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 28 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:54,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1865 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 292 Invalid, 0 Unknown, 540 Unchecked, 0.2s Time] [2021-12-28 05:42:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-12-28 05:42:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 303. [2021-12-28 05:42:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 265 states have (on average 1.3169811320754716) internal successors, (349), 293 states have internal predecessors, (349), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-28 05:42:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 365 transitions. [2021-12-28 05:42:54,846 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 365 transitions. Word has length 44 [2021-12-28 05:42:54,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:54,846 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 365 transitions. [2021-12-28 05:42:54,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 365 transitions. [2021-12-28 05:42:54,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:42:54,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:54,847 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:42:54,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-28 05:42:55,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:55,065 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-28 05:42:55,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash -686003701, now seen corresponding path program 1 times [2021-12-28 05:42:55,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:55,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053145666] [2021-12-28 05:42:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:55,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-28 05:42:55,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:55,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053145666] [2021-12-28 05:42:55,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053145666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:42:55,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:42:55,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:42:55,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121729263] [2021-12-28 05:42:55,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:42:55,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:42:55,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:42:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:42:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:42:55,092 INFO L87 Difference]: Start difference. First operand 303 states and 365 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:55,109 INFO L93 Difference]: Finished difference Result 398 states and 486 transitions. [2021-12-28 05:42:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:42:55,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-28 05:42:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:55,111 INFO L225 Difference]: With dead ends: 398 [2021-12-28 05:42:55,112 INFO L226 Difference]: Without dead ends: 398 [2021-12-28 05:42:55,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:42:55,112 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:55,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 331 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:42:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-12-28 05:42:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 307. [2021-12-28 05:42:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 269 states have (on average 1.3011152416356877) internal successors, (350), 297 states have internal predecessors, (350), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-28 05:42:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 366 transitions. [2021-12-28 05:42:55,122 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 366 transitions. Word has length 44 [2021-12-28 05:42:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:55,122 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 366 transitions. [2021-12-28 05:42:55,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:42:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 366 transitions. [2021-12-28 05:42:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-28 05:42:55,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:55,123 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, 1, 1, 1] [2021-12-28 05:42:55,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 05:42:55,124 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-28 05:42:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:55,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1834257435, now seen corresponding path program 1 times [2021-12-28 05:42:55,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:42:55,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500095485] [2021-12-28 05:42:55,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:55,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:42:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 05:42:55,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:42:55,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500095485] [2021-12-28 05:42:55,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500095485] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:42:55,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025960699] [2021-12-28 05:42:55,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:55,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:42:55,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:42:55,413 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:42:55,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-28 05:42:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:55,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-28 05:42:55,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:55,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:55,829 INFO L387 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-28 05:42:55,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:55,834 INFO L387 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-28 05:42:55,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:55,965 INFO L387 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-28 05:42:55,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:55,969 INFO L387 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-28 05:42:56,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:56,105 INFO L387 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-28 05:42:56,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:56,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:56,123 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:42:56,123 INFO L387 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-28 05:42:56,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:56,193 INFO L387 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-28 05:42:56,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:56,199 INFO L387 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-28 05:42:56,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:56,216 INFO L387 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-28 05:42:56,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:56,221 INFO L387 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-28 05:42:56,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:56,283 INFO L387 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-28 05:42:56,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:56,287 INFO L387 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-28 05:42:56,314 INFO L387 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-28 05:42:56,317 INFO L387 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-28 05:42:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-28 05:42:56,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:56,343 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-28 05:42:56,354 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-28 05:42:56,361 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-28 05:42:56,403 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-28 05:42:56,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:56,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:56,592 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:56,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:56,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-28 05:42:57,140 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_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:59,633 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_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) is different from false [2021-12-28 05:42:59,806 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_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) is different from false