./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 03:34:01,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 03:34:01,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 03:34:01,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 03:34:01,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 03:34:01,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 03:34:01,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 03:34:01,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 03:34:01,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 03:34:01,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 03:34:01,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 03:34:01,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 03:34:01,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 03:34:01,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 03:34:01,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 03:34:01,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 03:34:01,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 03:34:01,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 03:34:01,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 03:34:01,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 03:34:01,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 03:34:01,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 03:34:01,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 03:34:01,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 03:34:01,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 03:34:01,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 03:34:01,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 03:34:01,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 03:34:01,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 03:34:01,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 03:34:01,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 03:34:01,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 03:34:01,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 03:34:01,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 03:34:01,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 03:34:01,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 03:34:01,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 03:34:01,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 03:34:01,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 03:34:01,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 03:34:01,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 03:34:01,734 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-23 03:34:01,781 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 03:34:01,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 03:34:01,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 03:34:01,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 03:34:01,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 03:34:01,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 03:34:01,785 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 03:34:01,785 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 03:34:01,785 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 03:34:01,786 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 03:34:01,787 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 03:34:01,787 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 03:34:01,787 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 03:34:01,787 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 03:34:01,788 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 03:34:01,788 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 03:34:01,788 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 03:34:01,788 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 03:34:01,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 03:34:01,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 03:34:01,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 03:34:01,790 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 03:34:01,790 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 03:34:01,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 03:34:01,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 03:34:01,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 03:34:01,792 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 03:34:01,793 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 03:34:01,793 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 03:34:01,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 03:34:01,794 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 03:34:01,794 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 03:34:01,794 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 03:34:01,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 03:34:01,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 03:34:01,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:34:01,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 03:34:01,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 03:34:01,795 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 03:34:01,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 03:34:01,796 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 03:34:01,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 03:34:01,796 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2021-11-23 03:34:02,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 03:34:02,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 03:34:02,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 03:34:02,092 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 03:34:02,092 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 03:34:02,094 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2021-11-23 03:34:02,177 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/data/079bf3f67/1f5e7c99fd2240e086ac058ad0dcb1e3/FLAGa81533fcc [2021-11-23 03:34:02,763 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 03:34:02,764 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2021-11-23 03:34:02,798 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/data/079bf3f67/1f5e7c99fd2240e086ac058ad0dcb1e3/FLAGa81533fcc [2021-11-23 03:34:03,045 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/data/079bf3f67/1f5e7c99fd2240e086ac058ad0dcb1e3 [2021-11-23 03:34:03,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 03:34:03,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 03:34:03,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 03:34:03,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 03:34:03,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 03:34:03,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13534878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03, skipping insertion in model container [2021-11-23 03:34:03,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 03:34:03,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 03:34:03,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2021-11-23 03:34:03,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:34:03,541 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 03:34:03,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2021-11-23 03:34:03,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:34:03,663 INFO L208 MainTranslator]: Completed translation [2021-11-23 03:34:03,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03 WrapperNode [2021-11-23 03:34:03,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 03:34:03,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 03:34:03,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 03:34:03,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 03:34:03,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,768 INFO L137 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2021-11-23 03:34:03,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 03:34:03,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 03:34:03,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 03:34:03,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 03:34:03,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 03:34:03,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 03:34:03,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 03:34:03,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 03:34:03,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (1/1) ... [2021-11-23 03:34:03,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:34:03,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:34:03,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 03:34:03,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 03:34:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-11-23 03:34:03,944 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-11-23 03:34:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 03:34:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 03:34:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 03:34:03,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 03:34:03,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 03:34:03,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 03:34:03,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 03:34:03,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 03:34:03,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 03:34:03,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 03:34:04,167 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 03:34:04,169 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 03:34:04,217 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-11-23 03:34:04,534 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 03:34:04,596 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 03:34:04,596 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-23 03:34:04,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:04 BoogieIcfgContainer [2021-11-23 03:34:04,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 03:34:04,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 03:34:04,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 03:34:04,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 03:34:04,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:34:03" (1/3) ... [2021-11-23 03:34:04,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39699f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:04, skipping insertion in model container [2021-11-23 03:34:04,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:03" (2/3) ... [2021-11-23 03:34:04,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39699f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:04, skipping insertion in model container [2021-11-23 03:34:04,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:04" (3/3) ... [2021-11-23 03:34:04,608 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2021-11-23 03:34:04,614 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 03:34:04,614 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-11-23 03:34:04,661 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 03:34:04,669 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-11-23 03:34:04,669 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-11-23 03:34:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 92 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-23 03:34:04,693 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:04,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-23 03:34:04,694 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:04,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:04,700 INFO L85 PathProgramCache]: Analyzing trace with hash 295585, now seen corresponding path program 1 times [2021-11-23 03:34:04,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:04,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961966527] [2021-11-23 03:34:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:04,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:04,920 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:04,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961966527] [2021-11-23 03:34:04,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961966527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:04,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:04,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-23 03:34:04,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986918652] [2021-11-23 03:34:04,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:04,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:34:04,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:04,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:34:04,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:34:04,970 INFO L87 Difference]: Start difference. First operand has 94 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 92 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:05,188 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2021-11-23 03:34:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:34:05,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-23 03:34:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:05,198 INFO L225 Difference]: With dead ends: 115 [2021-11-23 03:34:05,198 INFO L226 Difference]: Without dead ends: 110 [2021-11-23 03:34:05,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-23 03:34:05,219 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 93 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:05,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 70 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:34:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-23 03:34:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2021-11-23 03:34:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 2.106382978723404) internal successors, (99), 86 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2021-11-23 03:34:05,262 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 3 [2021-11-23 03:34:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:05,263 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2021-11-23 03:34:05,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2021-11-23 03:34:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-23 03:34:05,264 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:05,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-23 03:34:05,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 03:34:05,264 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash 295586, now seen corresponding path program 1 times [2021-11-23 03:34:05,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:05,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315035543] [2021-11-23 03:34:05,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:05,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:05,303 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:05,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315035543] [2021-11-23 03:34:05,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315035543] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:05,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:05,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 03:34:05,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302944955] [2021-11-23 03:34:05,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:05,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:34:05,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:05,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:34:05,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:34:05,307 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:05,391 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2021-11-23 03:34:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:34:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-23 03:34:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:05,394 INFO L225 Difference]: With dead ends: 125 [2021-11-23 03:34:05,395 INFO L226 Difference]: Without dead ends: 125 [2021-11-23 03:34:05,395 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-11-23 03:34:05,397 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:05,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 137 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-23 03:34:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2021-11-23 03:34:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 87 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2021-11-23 03:34:05,413 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 3 [2021-11-23 03:34:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:05,413 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2021-11-23 03:34:05,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2021-11-23 03:34:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 03:34:05,414 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:05,415 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:05,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 03:34:05,415 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1113659344, now seen corresponding path program 1 times [2021-11-23 03:34:05,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:05,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066767845] [2021-11-23 03:34:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:05,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:05,489 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:05,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066767845] [2021-11-23 03:34:05,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066767845] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:34:05,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538816342] [2021-11-23 03:34:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:05,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:34:05,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:34:05,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:34:05,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 03:34:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:05,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 03:34:05,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:34:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:05,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:34:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:05,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538816342] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:34:05,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [163191829] [2021-11-23 03:34:05,761 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 03:34:05,763 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:34:05,769 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:34:05,774 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:34:05,775 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:34:05,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:05,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:05,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:34:06,535 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:34:06,898 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '561#(and (<= 3 |ULTIMATE.start_main_~min~0#1|) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_main_~max~0#1| 5) (< (select |#length| |ULTIMATE.start_main_~#head~1#1.base|) (+ |ULTIMATE.start_main_~#head~1#1.offset| 4)) (<= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 5 |ULTIMATE.start_main_~max~0#1|) (< |ULTIMATE.start_main_~max~0#1| |ULTIMATE.start_main_~i~0#1|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 0 |ULTIMATE.start_main_~#head~1#1.offset|) (<= |ULTIMATE.start_main_~min~0#1| 3) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2021-11-23 03:34:06,899 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:34:06,899 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:34:06,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-11-23 03:34:06,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47804491] [2021-11-23 03:34:06,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:34:06,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:34:06,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:06,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:34:06,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-11-23 03:34:06,902 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:07,097 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2021-11-23 03:34:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:34:07,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-23 03:34:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:07,100 INFO L225 Difference]: With dead ends: 197 [2021-11-23 03:34:07,100 INFO L226 Difference]: Without dead ends: 197 [2021-11-23 03:34:07,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-11-23 03:34:07,102 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 171 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:07,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 410 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:34:07,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-23 03:34:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2021-11-23 03:34:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 2.065934065934066) internal successors, (188), 130 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2021-11-23 03:34:07,116 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 7 [2021-11-23 03:34:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:07,116 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2021-11-23 03:34:07,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2021-11-23 03:34:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 03:34:07,117 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:07,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:07,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 03:34:07,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:34:07,331 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:07,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash -164566719, now seen corresponding path program 1 times [2021-11-23 03:34:07,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:07,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361994324] [2021-11-23 03:34:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:07,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:07,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:07,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361994324] [2021-11-23 03:34:07,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361994324] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:07,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:07,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 03:34:07,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907967958] [2021-11-23 03:34:07,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:07,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:34:07,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:07,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:34:07,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:34:07,386 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:07,511 INFO L93 Difference]: Finished difference Result 190 states and 256 transitions. [2021-11-23 03:34:07,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:34:07,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-23 03:34:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:07,514 INFO L225 Difference]: With dead ends: 190 [2021-11-23 03:34:07,514 INFO L226 Difference]: Without dead ends: 190 [2021-11-23 03:34:07,515 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-11-23 03:34:07,517 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 87 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:07,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 127 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-23 03:34:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2021-11-23 03:34:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 91 states have (on average 2.0) internal successors, (182), 128 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 182 transitions. [2021-11-23 03:34:07,540 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 182 transitions. Word has length 8 [2021-11-23 03:34:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:07,541 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 182 transitions. [2021-11-23 03:34:07,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 182 transitions. [2021-11-23 03:34:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 03:34:07,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:07,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:07,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 03:34:07,542 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:07,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:07,543 INFO L85 PathProgramCache]: Analyzing trace with hash -164566718, now seen corresponding path program 1 times [2021-11-23 03:34:07,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:07,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228526851] [2021-11-23 03:34:07,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:07,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:07,666 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:07,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228526851] [2021-11-23 03:34:07,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228526851] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:07,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:07,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:34:07,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524271391] [2021-11-23 03:34:07,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:07,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:34:07,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:07,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:34:07,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:34:07,675 INFO L87 Difference]: Start difference. First operand 129 states and 182 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:07,947 INFO L93 Difference]: Finished difference Result 301 states and 386 transitions. [2021-11-23 03:34:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:34:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-23 03:34:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:07,950 INFO L225 Difference]: With dead ends: 301 [2021-11-23 03:34:07,950 INFO L226 Difference]: Without dead ends: 301 [2021-11-23 03:34:07,951 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-11-23 03:34:07,952 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 195 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:07,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 491 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:34:07,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-23 03:34:07,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 132. [2021-11-23 03:34:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.9680851063829787) internal successors, (185), 131 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2021-11-23 03:34:07,964 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 8 [2021-11-23 03:34:07,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:07,965 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2021-11-23 03:34:07,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2021-11-23 03:34:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 03:34:07,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:07,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:07,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 03:34:07,967 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash -806836785, now seen corresponding path program 1 times [2021-11-23 03:34:07,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:07,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500733815] [2021-11-23 03:34:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:07,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:08,008 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:08,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500733815] [2021-11-23 03:34:08,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500733815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:08,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:08,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 03:34:08,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427586766] [2021-11-23 03:34:08,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:08,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:34:08,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:08,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:34:08,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:34:08,011 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:08,118 INFO L93 Difference]: Finished difference Result 198 states and 262 transitions. [2021-11-23 03:34:08,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:34:08,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-23 03:34:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:08,120 INFO L225 Difference]: With dead ends: 198 [2021-11-23 03:34:08,120 INFO L226 Difference]: Without dead ends: 198 [2021-11-23 03:34:08,120 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-11-23 03:34:08,121 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 87 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:08,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 132 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-23 03:34:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 131. [2021-11-23 03:34:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 94 states have (on average 1.9361702127659575) internal successors, (182), 130 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2021-11-23 03:34:08,129 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 9 [2021-11-23 03:34:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:08,129 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2021-11-23 03:34:08,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2021-11-23 03:34:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 03:34:08,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:08,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:08,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 03:34:08,131 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:08,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash -806836784, now seen corresponding path program 1 times [2021-11-23 03:34:08,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:08,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169394932] [2021-11-23 03:34:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:08,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:08,170 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:08,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169394932] [2021-11-23 03:34:08,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169394932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:08,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:08,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 03:34:08,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722426096] [2021-11-23 03:34:08,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:08,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:34:08,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:08,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:34:08,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:34:08,173 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:08,270 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2021-11-23 03:34:08,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:34:08,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-23 03:34:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:08,272 INFO L225 Difference]: With dead ends: 199 [2021-11-23 03:34:08,272 INFO L226 Difference]: Without dead ends: 199 [2021-11-23 03:34:08,273 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-11-23 03:34:08,273 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 90 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:08,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 136 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:08,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-23 03:34:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 130. [2021-11-23 03:34:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 94 states have (on average 1.9042553191489362) internal successors, (179), 129 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2021-11-23 03:34:08,279 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 9 [2021-11-23 03:34:08,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:08,293 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2021-11-23 03:34:08,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2021-11-23 03:34:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 03:34:08,294 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:08,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:08,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 03:34:08,295 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:08,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2019147847, now seen corresponding path program 1 times [2021-11-23 03:34:08,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:08,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707662030] [2021-11-23 03:34:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:08,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:08,360 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:08,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707662030] [2021-11-23 03:34:08,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707662030] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:34:08,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655168970] [2021-11-23 03:34:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:08,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:34:08,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:34:08,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:34:08,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 03:34:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:08,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 03:34:08,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:34:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:08,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:34:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:08,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655168970] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:34:08,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1028649460] [2021-11-23 03:34:08,550 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-23 03:34:08,550 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:34:08,550 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:34:08,551 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:34:08,551 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:34:08,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:34:08,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2021-11-23 03:34:08,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2021-11-23 03:34:08,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:34:08,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-23 03:34:08,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:08,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:34:09,273 INFO L354 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2021-11-23 03:34:09,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 408 treesize of output 416 [2021-11-23 03:34:09,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:34:09,880 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:34:09,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 451 [2021-11-23 03:34:09,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:34:09,959 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-11-23 03:34:09,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 466 treesize of output 464 [2021-11-23 03:34:09,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:10,018 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 03:34:10,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 495 treesize of output 478 [2021-11-23 03:34:10,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:10,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:34:10,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:34:10,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:34:10,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:34:10,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:10,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:34:10,472 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:34:12,112 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2391#(and (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (< (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2021-11-23 03:34:12,113 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:34:12,113 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:34:12,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-11-23 03:34:12,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504816293] [2021-11-23 03:34:12,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:34:12,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 03:34:12,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:12,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 03:34:12,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-11-23 03:34:12,115 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:12,479 INFO L93 Difference]: Finished difference Result 309 states and 386 transitions. [2021-11-23 03:34:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:34:12,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-23 03:34:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:12,481 INFO L225 Difference]: With dead ends: 309 [2021-11-23 03:34:12,481 INFO L226 Difference]: Without dead ends: 309 [2021-11-23 03:34:12,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-11-23 03:34:12,482 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 193 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:12,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 800 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:34:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-11-23 03:34:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 148. [2021-11-23 03:34:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 147 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 197 transitions. [2021-11-23 03:34:12,488 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 197 transitions. Word has length 11 [2021-11-23 03:34:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:12,488 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 197 transitions. [2021-11-23 03:34:12,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 197 transitions. [2021-11-23 03:34:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 03:34:12,489 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:12,490 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1] [2021-11-23 03:34:12,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 03:34:12,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:34:12,715 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1990905420, now seen corresponding path program 2 times [2021-11-23 03:34:12,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:12,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874347537] [2021-11-23 03:34:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:12,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 03:34:12,762 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:12,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874347537] [2021-11-23 03:34:12,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874347537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:12,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:12,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-23 03:34:12,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992127143] [2021-11-23 03:34:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:12,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:34:12,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:34:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:34:12,764 INFO L87 Difference]: Start difference. First operand 148 states and 197 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:12,839 INFO L93 Difference]: Finished difference Result 207 states and 269 transitions. [2021-11-23 03:34:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:34:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-23 03:34:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:12,842 INFO L225 Difference]: With dead ends: 207 [2021-11-23 03:34:12,842 INFO L226 Difference]: Without dead ends: 207 [2021-11-23 03:34:12,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-23 03:34:12,845 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 51 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:12,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 115 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-23 03:34:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2021-11-23 03:34:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 140 states have (on average 1.7357142857142858) internal successors, (243), 175 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2021-11-23 03:34:12,855 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 15 [2021-11-23 03:34:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:12,856 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2021-11-23 03:34:12,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2021-11-23 03:34:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 03:34:12,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:12,858 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:12,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 03:34:12,858 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:12,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash -279277977, now seen corresponding path program 2 times [2021-11-23 03:34:12,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:12,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769784991] [2021-11-23 03:34:12,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:12,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:34:13,071 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:13,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769784991] [2021-11-23 03:34:13,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769784991] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:34:13,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112724990] [2021-11-23 03:34:13,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 03:34:13,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:34:13,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:34:13,075 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:34:13,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 03:34:13,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-23 03:34:13,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 03:34:13,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 03:34:13,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:34:13,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:13,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:13,267 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 03:34:13,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2021-11-23 03:34:13,289 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 03:34:13,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-11-23 03:34:13,456 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 03:34:13,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2021-11-23 03:34:13,473 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-23 03:34:13,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:34:13,724 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 03:34:13,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 42 [2021-11-23 03:34:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 03:34:13,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:34:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:14,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112724990] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:34:14,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [371566542] [2021-11-23 03:34:14,461 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-23 03:34:14,462 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:34:14,462 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:34:14,462 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:34:14,463 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:34:14,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:34:14,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2021-11-23 03:34:14,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2021-11-23 03:34:14,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-23 03:34:14,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:34:14,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:14,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:34:15,156 INFO L354 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2021-11-23 03:34:15,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 408 treesize of output 416 [2021-11-23 03:34:15,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:34:15,736 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-11-23 03:34:15,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 449 treesize of output 447 [2021-11-23 03:34:15,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:15,785 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 03:34:15,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 454 treesize of output 437 [2021-11-23 03:34:15,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:34:15,847 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-11-23 03:34:15,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 439 treesize of output 437 [2021-11-23 03:34:15,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:15,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:34:16,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:34:16,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:34:16,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:34:16,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:16,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:34:16,181 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:34:17,546 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3357#(and (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (< (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2021-11-23 03:34:17,546 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:34:17,546 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:34:17,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 10 [2021-11-23 03:34:17,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358522049] [2021-11-23 03:34:17,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:34:17,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 03:34:17,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:17,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 03:34:17,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-11-23 03:34:17,549 INFO L87 Difference]: Start difference. First operand 176 states and 243 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:17,762 INFO L93 Difference]: Finished difference Result 175 states and 240 transitions. [2021-11-23 03:34:17,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:34:17,763 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-23 03:34:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:17,766 INFO L225 Difference]: With dead ends: 175 [2021-11-23 03:34:17,766 INFO L226 Difference]: Without dead ends: 175 [2021-11-23 03:34:17,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2021-11-23 03:34:17,768 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:17,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 162 Unchecked, 0.1s Time] [2021-11-23 03:34:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-23 03:34:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-11-23 03:34:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.7142857142857142) internal successors, (240), 174 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 240 transitions. [2021-11-23 03:34:17,777 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 240 transitions. Word has length 17 [2021-11-23 03:34:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:17,777 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 240 transitions. [2021-11-23 03:34:17,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 240 transitions. [2021-11-23 03:34:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-23 03:34:17,779 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:17,779 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:17,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 03:34:18,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-23 03:34:18,002 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:18,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:18,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1864429725, now seen corresponding path program 1 times [2021-11-23 03:34:18,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:18,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752767298] [2021-11-23 03:34:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:18,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 03:34:18,058 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:18,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752767298] [2021-11-23 03:34:18,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752767298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:18,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:18,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:34:18,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868309447] [2021-11-23 03:34:18,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:18,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:34:18,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:18,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:34:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:34:18,064 INFO L87 Difference]: Start difference. First operand 175 states and 240 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:18,151 INFO L93 Difference]: Finished difference Result 202 states and 255 transitions. [2021-11-23 03:34:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:34:18,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-23 03:34:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:18,158 INFO L225 Difference]: With dead ends: 202 [2021-11-23 03:34:18,158 INFO L226 Difference]: Without dead ends: 202 [2021-11-23 03:34:18,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-23 03:34:18,160 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:18,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 176 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-23 03:34:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 164. [2021-11-23 03:34:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.6666666666666667) internal successors, (215), 163 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 215 transitions. [2021-11-23 03:34:18,166 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 215 transitions. Word has length 18 [2021-11-23 03:34:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:18,166 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 215 transitions. [2021-11-23 03:34:18,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2021-11-23 03:34:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-23 03:34:18,168 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:18,168 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:18,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 03:34:18,168 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:18,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:18,169 INFO L85 PathProgramCache]: Analyzing trace with hash -67676486, now seen corresponding path program 1 times [2021-11-23 03:34:18,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:18,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659795656] [2021-11-23 03:34:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:18,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 03:34:18,210 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:18,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659795656] [2021-11-23 03:34:18,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659795656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:18,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:18,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:34:18,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002156579] [2021-11-23 03:34:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:18,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:34:18,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:18,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:34:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:34:18,213 INFO L87 Difference]: Start difference. First operand 164 states and 215 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:18,297 INFO L93 Difference]: Finished difference Result 188 states and 238 transitions. [2021-11-23 03:34:18,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:34:18,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-23 03:34:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:18,300 INFO L225 Difference]: With dead ends: 188 [2021-11-23 03:34:18,300 INFO L226 Difference]: Without dead ends: 188 [2021-11-23 03:34:18,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:34:18,301 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 90 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:18,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 119 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-23 03:34:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2021-11-23 03:34:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 162 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 212 transitions. [2021-11-23 03:34:18,307 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 212 transitions. Word has length 18 [2021-11-23 03:34:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:18,307 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 212 transitions. [2021-11-23 03:34:18,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 212 transitions. [2021-11-23 03:34:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 03:34:18,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:18,309 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:18,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 03:34:18,309 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:18,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1967460204, now seen corresponding path program 1 times [2021-11-23 03:34:18,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:18,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384587839] [2021-11-23 03:34:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:18,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 03:34:18,347 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:18,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384587839] [2021-11-23 03:34:18,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384587839] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:18,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:18,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:34:18,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137343525] [2021-11-23 03:34:18,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:18,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:34:18,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:18,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:34:18,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:34:18,350 INFO L87 Difference]: Start difference. First operand 163 states and 212 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:18,457 INFO L93 Difference]: Finished difference Result 179 states and 228 transitions. [2021-11-23 03:34:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:34:18,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-23 03:34:18,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:18,461 INFO L225 Difference]: With dead ends: 179 [2021-11-23 03:34:18,461 INFO L226 Difference]: Without dead ends: 179 [2021-11-23 03:34:18,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-23 03:34:18,463 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 7 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:18,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 189 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-11-23 03:34:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 164. [2021-11-23 03:34:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 130 states have (on average 1.6384615384615384) internal successors, (213), 163 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2021-11-23 03:34:18,480 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 19 [2021-11-23 03:34:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:18,482 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2021-11-23 03:34:18,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2021-11-23 03:34:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 03:34:18,486 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:18,486 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:18,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 03:34:18,487 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:18,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1967462510, now seen corresponding path program 1 times [2021-11-23 03:34:18,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:18,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407718833] [2021-11-23 03:34:18,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:18,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 03:34:18,549 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:18,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407718833] [2021-11-23 03:34:18,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407718833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:18,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:18,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 03:34:18,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648287273] [2021-11-23 03:34:18,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:18,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:34:18,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:34:18,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:34:18,552 INFO L87 Difference]: Start difference. First operand 164 states and 213 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:18,637 INFO L93 Difference]: Finished difference Result 165 states and 213 transitions. [2021-11-23 03:34:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:34:18,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-23 03:34:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:18,638 INFO L225 Difference]: With dead ends: 165 [2021-11-23 03:34:18,638 INFO L226 Difference]: Without dead ends: 160 [2021-11-23 03:34:18,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:34:18,639 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:18,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-23 03:34:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2021-11-23 03:34:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 124 states have (on average 1.6612903225806452) internal successors, (206), 157 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2021-11-23 03:34:18,644 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 19 [2021-11-23 03:34:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:18,645 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2021-11-23 03:34:18,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2021-11-23 03:34:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 03:34:18,646 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:18,646 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:18,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 03:34:18,646 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2097964542, now seen corresponding path program 1 times [2021-11-23 03:34:18,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:18,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575341559] [2021-11-23 03:34:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:18,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 03:34:18,681 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:18,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575341559] [2021-11-23 03:34:18,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575341559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:18,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:18,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:34:18,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239360012] [2021-11-23 03:34:18,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:18,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:34:18,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:18,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:34:18,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:34:18,684 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:18,768 INFO L93 Difference]: Finished difference Result 180 states and 228 transitions. [2021-11-23 03:34:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:34:18,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-23 03:34:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:18,769 INFO L225 Difference]: With dead ends: 180 [2021-11-23 03:34:18,770 INFO L226 Difference]: Without dead ends: 180 [2021-11-23 03:34:18,770 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-11-23 03:34:18,771 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 162 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:18,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 84 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-23 03:34:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 157. [2021-11-23 03:34:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.6370967741935485) internal successors, (203), 156 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2021-11-23 03:34:18,779 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 19 [2021-11-23 03:34:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:18,780 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2021-11-23 03:34:18,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2021-11-23 03:34:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 03:34:18,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:18,781 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:18,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 03:34:18,782 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2097964541, now seen corresponding path program 1 times [2021-11-23 03:34:18,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:18,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055178706] [2021-11-23 03:34:18,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:18,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 03:34:18,831 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:18,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055178706] [2021-11-23 03:34:18,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055178706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:18,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:18,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:34:18,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394069909] [2021-11-23 03:34:18,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:18,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:34:18,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:18,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:34:18,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:34:18,834 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:18,927 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2021-11-23 03:34:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:34:18,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-23 03:34:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:18,929 INFO L225 Difference]: With dead ends: 156 [2021-11-23 03:34:18,929 INFO L226 Difference]: Without dead ends: 156 [2021-11-23 03:34:18,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:34:18,930 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 169 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:18,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 63 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:34:18,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-23 03:34:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-11-23 03:34:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.6129032258064515) internal successors, (200), 155 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2021-11-23 03:34:18,937 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 19 [2021-11-23 03:34:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:18,937 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2021-11-23 03:34:18,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2021-11-23 03:34:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 03:34:18,938 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:18,939 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:18,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 03:34:18,939 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:18,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash -612391313, now seen corresponding path program 1 times [2021-11-23 03:34:18,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:18,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662736841] [2021-11-23 03:34:18,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:18,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:34:19,056 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:19,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662736841] [2021-11-23 03:34:19,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662736841] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:34:19,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235781908] [2021-11-23 03:34:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:19,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:34:19,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:34:19,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:34:19,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 03:34:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:19,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 03:34:19,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:34:19,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:19,227 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-23 03:34:19,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-11-23 03:34:19,352 INFO L354 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-11-23 03:34:19,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2021-11-23 03:34:19,635 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 03:34:19,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 31 [2021-11-23 03:34:19,801 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-11-23 03:34:19,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 51 [2021-11-23 03:34:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 03:34:20,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:34:22,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_22| Int)) (<= (+ |c_ULTIMATE.start_sll_append_~head#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| 8) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_22| 8) |c_ULTIMATE.start_sll_append_~head#1.base|))) (<= 0 |c_ULTIMATE.start_sll_append_~head#1.offset|)))) is different from false [2021-11-23 03:34:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-23 03:34:26,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235781908] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:34:26,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1182798320] [2021-11-23 03:34:26,663 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-23 03:34:26,663 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:34:26,664 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:34:26,664 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:34:26,664 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:34:26,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:34:26,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2021-11-23 03:34:26,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2021-11-23 03:34:26,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-23 03:34:26,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:26,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:34:27,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:27,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:34:27,303 INFO L354 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2021-11-23 03:34:27,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 408 treesize of output 416 [2021-11-23 03:34:27,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:34:27,780 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-11-23 03:34:27,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 451 [2021-11-23 03:34:27,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:27,827 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 03:34:27,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 482 treesize of output 465 [2021-11-23 03:34:27,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:34:27,889 INFO L354 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2021-11-23 03:34:27,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 467 treesize of output 465 [2021-11-23 03:34:28,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:34:28,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:28,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:34:28,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:34:28,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:34:28,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:28,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:34:28,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:34:28,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:34:28,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:34:28,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:28,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:34:28,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:28,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:34:28,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:34:28,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:28,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:34:28,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:28,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:34:28,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:34:28,500 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:34:30,773 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5917#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (< (select |#length| |ULTIMATE.start_sll_append_~head#1.base|) (+ |ULTIMATE.start_sll_append_~head#1.offset| 4)) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2021-11-23 03:34:30,773 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:34:30,773 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:34:30,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 5] total 11 [2021-11-23 03:34:30,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965910409] [2021-11-23 03:34:30,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:34:30,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 03:34:30,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:30,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 03:34:30,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=372, Unknown=3, NotChecked=40, Total=506 [2021-11-23 03:34:30,775 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:31,083 INFO L93 Difference]: Finished difference Result 272 states and 334 transitions. [2021-11-23 03:34:31,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:34:31,084 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-23 03:34:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:31,086 INFO L225 Difference]: With dead ends: 272 [2021-11-23 03:34:31,086 INFO L226 Difference]: Without dead ends: 272 [2021-11-23 03:34:31,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=122, Invalid=479, Unknown=3, NotChecked=46, Total=650 [2021-11-23 03:34:31,088 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 68 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:31,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 383 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 314 Unchecked, 0.2s Time] [2021-11-23 03:34:31,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-23 03:34:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 204. [2021-11-23 03:34:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 172 states have (on average 1.4767441860465116) internal successors, (254), 203 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2021-11-23 03:34:31,096 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 20 [2021-11-23 03:34:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:31,096 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2021-11-23 03:34:31,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2021-11-23 03:34:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 03:34:31,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:31,098 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:31,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 03:34:31,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 03:34:31,316 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash -612391314, now seen corresponding path program 1 times [2021-11-23 03:34:31,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:31,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363362862] [2021-11-23 03:34:31,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:31,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:34:31,435 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:31,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363362862] [2021-11-23 03:34:31,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363362862] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:34:31,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806660619] [2021-11-23 03:34:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:31,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:34:31,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:34:31,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:34:31,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 03:34:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:31,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 03:34:31,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:34:31,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:31,570 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 03:34:31,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-23 03:34:31,613 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 03:34:31,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:34:31,660 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 03:34:31,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 27 [2021-11-23 03:34:31,747 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 03:34:31,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 35 [2021-11-23 03:34:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 03:34:31,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:34:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:34:47,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806660619] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:34:47,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1142036099] [2021-11-23 03:34:47,517 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-23 03:34:47,517 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:34:47,517 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:34:47,518 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:34:47,518 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:34:47,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:34:47,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2021-11-23 03:34:47,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2021-11-23 03:34:47,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-23 03:34:47,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:34:47,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:47,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:34:48,102 INFO L354 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2021-11-23 03:34:48,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 408 treesize of output 416 [2021-11-23 03:34:48,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:34:48,466 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-11-23 03:34:48,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 451 [2021-11-23 03:34:48,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:48,508 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 03:34:48,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 482 treesize of output 465 [2021-11-23 03:34:48,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:34:48,568 INFO L354 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2021-11-23 03:34:48,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 467 treesize of output 465 [2021-11-23 03:34:48,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:34:48,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:48,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:34:48,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:34:48,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:34:48,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:34:48,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:34:48,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:34:48,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:34:48,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:34:49,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:49,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:34:49,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:49,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:34:49,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:34:49,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:34:49,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:49,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:34:49,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:49,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:34:49,176 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:34:51,595 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6541#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2021-11-23 03:34:51,595 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:34:51,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:34:51,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 14 [2021-11-23 03:34:51,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266866712] [2021-11-23 03:34:51,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:34:51,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-23 03:34:51,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:51,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-23 03:34:51,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=516, Unknown=7, NotChecked=0, Total=650 [2021-11-23 03:34:51,598 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:51,850 INFO L93 Difference]: Finished difference Result 270 states and 330 transitions. [2021-11-23 03:34:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 03:34:51,851 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-23 03:34:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:51,852 INFO L225 Difference]: With dead ends: 270 [2021-11-23 03:34:51,852 INFO L226 Difference]: Without dead ends: 270 [2021-11-23 03:34:51,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=173, Invalid=632, Unknown=7, NotChecked=0, Total=812 [2021-11-23 03:34:51,854 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 186 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:51,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 479 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 227 Invalid, 0 Unknown, 220 Unchecked, 0.2s Time] [2021-11-23 03:34:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-23 03:34:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 204. [2021-11-23 03:34:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 172 states have (on average 1.4593023255813953) internal successors, (251), 203 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 251 transitions. [2021-11-23 03:34:51,860 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 251 transitions. Word has length 20 [2021-11-23 03:34:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:51,860 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 251 transitions. [2021-11-23 03:34:51,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:34:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 251 transitions. [2021-11-23 03:34:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 03:34:51,861 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:51,861 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:51,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 03:34:52,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 03:34:52,062 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:34:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash -97352723, now seen corresponding path program 1 times [2021-11-23 03:34:52,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:52,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618994755] [2021-11-23 03:34:52,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:52,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:34:52,374 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:52,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618994755] [2021-11-23 03:34:52,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618994755] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:34:52,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759133018] [2021-11-23 03:34:52,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:52,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:34:52,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:34:52,376 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:34:52,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 03:34:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:52,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-23 03:34:52,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:34:52,719 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:34:52,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-11-23 03:34:52,736 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:34:52,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-23 03:34:52,817 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:34:52,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-11-23 03:34:52,832 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:34:52,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-23 03:34:52,935 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:34:52,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-11-23 03:34:52,951 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:34:52,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-11-23 03:34:53,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:53,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:34:53,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:34:53,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:34:53,048 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:34:53,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:34:53,065 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:34:53,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:34:53,119 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:34:53,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 46 [2021-11-23 03:34:53,129 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:34:53,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 35 [2021-11-23 03:34:53,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-11-23 03:34:53,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-11-23 03:34:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:34:53,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:34:55,262 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2021-11-23 03:34:57,295 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2021-11-23 03:34:59,350 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-23 03:35:01,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_2 Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_1 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_1 v_subst_2))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_4 Int) (v_subst_3 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_3 v_subst_4))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|))) is different from false [2021-11-23 03:35:03,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_2 Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_1 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_1 v_subst_2))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_4 Int) (v_subst_3 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_3 v_subst_4))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|))) is different from false [2021-11-23 03:35:06,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_8 Int) (v_subst_7 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_4 Int) (v_subst_3 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_7 v_subst_8))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_3 v_subst_4))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_2 Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_1 Int)) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_5 v_subst_6))))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_1 v_subst_2))))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|))) is different from false [2021-11-23 03:35:09,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_2 Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_1 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_5 v_subst_6))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_1 v_subst_2))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_8 Int) (v_subst_7 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_4 Int) (v_subst_3 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_7 v_subst_8))))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_3 v_subst_4))))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|))))) is different from false [2021-11-23 03:35:12,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_2 Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_1 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_5 v_subst_6))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_1 v_subst_2))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 4 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) 0 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_8 Int) (v_subst_7 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_4 Int) (v_subst_3 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_7 v_subst_8))))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_3 v_subst_4))))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 4 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) 0 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) is different from false [2021-11-23 03:35:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-11-23 03:35:12,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759133018] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:35:12,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [276529866] [2021-11-23 03:35:12,880 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-23 03:35:12,881 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:35:12,881 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:35:12,881 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:35:12,882 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:35:12,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:12,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:12,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:35:12,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:12,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:12,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:12,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:12,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:12,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2021-11-23 03:35:13,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2021-11-23 03:35:13,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-23 03:35:13,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:35:13,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:35:13,429 INFO L354 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2021-11-23 03:35:13,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 408 treesize of output 416 [2021-11-23 03:35:13,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:13,786 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 03:35:13,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 456 treesize of output 439 [2021-11-23 03:35:13,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:35:13,853 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:35:13,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 441 treesize of output 439 [2021-11-23 03:35:13,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:35:13,906 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-11-23 03:35:13,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 458 treesize of output 456 [2021-11-23 03:35:13,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:35:14,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:35:14,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:35:14,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:35:14,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:35:14,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:35:14,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:35:14,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:35:14,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:35:14,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:35:14,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:14,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:35:14,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:35:14,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:14,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:35:14,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:35:14,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:14,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:35:14,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:14,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:35:14,440 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:35:17,635 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7186#(and (<= (+ |ULTIMATE.start_sll_append_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~temp~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_append_~temp~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (or (not (= |ULTIMATE.start_sll_append_~temp~0#1.base| 0)) (not (= |ULTIMATE.start_sll_append_~temp~0#1.offset| 0))) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2021-11-23 03:35:17,636 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:35:17,636 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:35:17,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 25 [2021-11-23 03:35:17,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240113932] [2021-11-23 03:35:17,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:35:17,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-23 03:35:17,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:35:17,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-23 03:35:17,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=747, Unknown=8, NotChecked=504, Total=1406 [2021-11-23 03:35:17,638 INFO L87 Difference]: Start difference. First operand 204 states and 251 transitions. Second operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:19,649 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_2 Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_1 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_5 v_subst_6))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_1 v_subst_2))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 4 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) 0 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_8 Int) (v_subst_7 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_4 Int) (v_subst_3 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_7 v_subst_8))))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_3 v_subst_4))))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 4 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) 0 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) is different from false [2021-11-23 03:35:21,659 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_2 Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_1 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_5 v_subst_6))))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_1 v_subst_2))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_8 Int) (v_subst_7 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_4 Int) (v_subst_3 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_40|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_7 v_subst_8))))) (store .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_3 v_subst_4))))) (store .cse5 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse5 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select .cse0 0) 0))) is different from false [2021-11-23 03:35:23,668 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_8 Int) (v_subst_7 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_4 Int) (v_subst_3 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_7 v_subst_8))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_3 v_subst_4))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_2 Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_1 Int)) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) v_subst_5 v_subst_6))))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_1 v_subst_2))))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-11-23 03:35:25,677 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_2 Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_1 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_1 v_subst_2))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_4 Int) (v_subst_3 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_3 v_subst_4))))) (store .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_39|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select .cse0 0) 0))) is different from false [2021-11-23 03:35:27,692 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_2 Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_1 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_1 v_subst_2))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_4 Int) (v_subst_3 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) v_subst_3 v_subst_4))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-11-23 03:35:29,698 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_38|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select .cse0 0) 0))) is different from false [2021-11-23 03:35:31,704 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2021-11-23 03:35:33,710 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select .cse0 0) 0))) is different from false [2021-11-23 03:35:35,714 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= (select .cse0 0) 0))) is different from false [2021-11-23 03:35:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:35:36,476 INFO L93 Difference]: Finished difference Result 225 states and 273 transitions. [2021-11-23 03:35:36,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-23 03:35:36,477 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-23 03:35:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:35:36,479 INFO L225 Difference]: With dead ends: 225 [2021-11-23 03:35:36,479 INFO L226 Difference]: Without dead ends: 225 [2021-11-23 03:35:36,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=255, Invalid=1128, Unknown=17, NotChecked=1462, Total=2862 [2021-11-23 03:35:36,482 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 37 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 03:35:36,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 938 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 420 Invalid, 0 Unknown, 381 Unchecked, 0.4s Time] [2021-11-23 03:35:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-23 03:35:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2021-11-23 03:35:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 173 states have (on average 1.4566473988439306) internal successors, (252), 204 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 252 transitions. [2021-11-23 03:35:36,497 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 252 transitions. Word has length 22 [2021-11-23 03:35:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:35:36,497 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 252 transitions. [2021-11-23 03:35:36,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 252 transitions. [2021-11-23 03:35:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 03:35:36,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:35:36,499 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:35:36,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 03:35:36,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:35:36,719 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:35:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:35:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash -97351959, now seen corresponding path program 1 times [2021-11-23 03:35:36,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:35:36,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328945339] [2021-11-23 03:35:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:35:36,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:35:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:35:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 03:35:36,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:35:36,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328945339] [2021-11-23 03:35:36,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328945339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:35:36,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:35:36,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 03:35:36,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765093677] [2021-11-23 03:35:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:35:36,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:35:36,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:35:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:35:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:35:36,754 INFO L87 Difference]: Start difference. First operand 205 states and 252 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:35:36,845 INFO L93 Difference]: Finished difference Result 227 states and 274 transitions. [2021-11-23 03:35:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:35:36,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-23 03:35:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:35:36,848 INFO L225 Difference]: With dead ends: 227 [2021-11-23 03:35:36,848 INFO L226 Difference]: Without dead ends: 227 [2021-11-23 03:35:36,848 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-11-23 03:35:36,849 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 71 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:35:36,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 72 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:35:36,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-11-23 03:35:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 204. [2021-11-23 03:35:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 173 states have (on average 1.439306358381503) internal successors, (249), 203 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 249 transitions. [2021-11-23 03:35:36,856 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 249 transitions. Word has length 22 [2021-11-23 03:35:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:35:36,857 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 249 transitions. [2021-11-23 03:35:36,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 249 transitions. [2021-11-23 03:35:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 03:35:36,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:35:36,858 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:35:36,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 03:35:36,859 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:35:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:35:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash -97351958, now seen corresponding path program 1 times [2021-11-23 03:35:36,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:35:36,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744283202] [2021-11-23 03:35:36,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:35:36,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:35:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:35:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 03:35:36,912 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:35:36,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744283202] [2021-11-23 03:35:36,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744283202] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:35:36,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:35:36,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:35:36,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089752010] [2021-11-23 03:35:36,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:35:36,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:35:36,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:35:36,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:35:36,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:35:36,915 INFO L87 Difference]: Start difference. First operand 204 states and 249 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:35:37,022 INFO L93 Difference]: Finished difference Result 203 states and 246 transitions. [2021-11-23 03:35:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:35:37,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-23 03:35:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:35:37,024 INFO L225 Difference]: With dead ends: 203 [2021-11-23 03:35:37,025 INFO L226 Difference]: Without dead ends: 203 [2021-11-23 03:35:37,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:35:37,026 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 162 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:35:37,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 63 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:35:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-11-23 03:35:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-11-23 03:35:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 173 states have (on average 1.4219653179190752) internal successors, (246), 202 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 246 transitions. [2021-11-23 03:35:37,033 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 246 transitions. Word has length 22 [2021-11-23 03:35:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:35:37,034 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 246 transitions. [2021-11-23 03:35:37,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 246 transitions. [2021-11-23 03:35:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 03:35:37,035 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:35:37,035 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:35:37,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-23 03:35:37,036 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:35:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:35:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1739646879, now seen corresponding path program 1 times [2021-11-23 03:35:37,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:35:37,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724342829] [2021-11-23 03:35:37,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:35:37,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:35:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:35:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:35:37,131 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:35:37,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724342829] [2021-11-23 03:35:37,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724342829] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:35:37,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932623375] [2021-11-23 03:35:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:35:37,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:35:37,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:35:37,135 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:35:37,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 03:35:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:35:37,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 03:35:37,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:35:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:35:37,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:35:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:35:37,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932623375] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:35:37,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1894754027] [2021-11-23 03:35:37,360 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-23 03:35:37,360 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:35:37,360 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:35:37,361 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:35:37,361 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:35:37,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:37,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:37,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:35:37,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:35:37,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:35:37,695 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 03:35:37,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 03:35:37,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-23 03:35:37,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:35:37,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:35:37,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:35:37,881 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-23 03:35:37,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 221 [2021-11-23 03:35:37,951 INFO L354 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-11-23 03:35:37,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 220 treesize of output 237 [2021-11-23 03:35:38,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:35:38,662 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:35:38,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 504 treesize of output 503 [2021-11-23 03:35:38,706 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:35:38,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 503 treesize of output 502 [2021-11-23 03:35:39,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:35:39,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:35:39,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:35:39,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:35:39,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:35:39,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:35:39,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:35:39,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:35:39,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:35:39,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:35:39,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:35:39,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:39,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:35:39,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:39,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:35:39,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:39,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:35:39,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:39,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:35:39,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:35:39,560 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:35:41,801 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8669#(and (<= (+ |ULTIMATE.start_sll_append_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (<= 3 |ULTIMATE.start_main_~min~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~temp~0#1.base|) (<= 0 |#NULL.base|) (not (= (select |#valid| |ULTIMATE.start_sll_append_~temp~0#1.base|) 1)) (<= |ULTIMATE.start_main_~max~0#1| 5) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_append_~temp~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (<= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 5 |ULTIMATE.start_main_~max~0#1|) (<= |#NULL.offset| 0) (or (not (= |ULTIMATE.start_sll_append_~temp~0#1.base| 0)) (not (= |ULTIMATE.start_sll_append_~temp~0#1.offset| 0))) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.offset|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (<= |ULTIMATE.start_main_~min~0#1| 3) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= |#NULL.base| 0) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |ULTIMATE.start_main_~j~0#1| 0))' at error location [2021-11-23 03:35:41,801 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:35:41,801 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:35:41,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2021-11-23 03:35:41,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022299142] [2021-11-23 03:35:41,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:35:41,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 03:35:41,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:35:41,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 03:35:41,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2021-11-23 03:35:41,803 INFO L87 Difference]: Start difference. First operand 203 states and 246 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:35:42,309 INFO L93 Difference]: Finished difference Result 384 states and 444 transitions. [2021-11-23 03:35:42,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 03:35:42,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-23 03:35:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:35:42,313 INFO L225 Difference]: With dead ends: 384 [2021-11-23 03:35:42,313 INFO L226 Difference]: Without dead ends: 384 [2021-11-23 03:35:42,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2021-11-23 03:35:42,314 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 207 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 03:35:42,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 1124 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 03:35:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-11-23 03:35:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 228. [2021-11-23 03:35:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 198 states have (on average 1.4343434343434343) internal successors, (284), 227 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 284 transitions. [2021-11-23 03:35:42,323 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 284 transitions. Word has length 26 [2021-11-23 03:35:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:35:42,324 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 284 transitions. [2021-11-23 03:35:42,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:35:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 284 transitions. [2021-11-23 03:35:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-23 03:35:42,325 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:35:42,326 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:35:42,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 03:35:42,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:35:42,540 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:35:42,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:35:42,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2064394944, now seen corresponding path program 2 times [2021-11-23 03:35:42,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:35:42,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786041472] [2021-11-23 03:35:42,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:35:42,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:35:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:35:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 03:35:42,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:35:42,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786041472] [2021-11-23 03:35:42,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786041472] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:35:42,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441917427] [2021-11-23 03:35:42,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 03:35:42,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:35:42,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:35:42,897 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:35:42,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 03:35:43,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-23 03:35:43,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 03:35:43,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-23 03:35:43,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:35:43,275 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:35:43,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2021-11-23 03:35:43,286 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:35:43,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2021-11-23 03:35:43,502 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:35:43,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-11-23 03:35:43,515 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:35:43,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-23 03:35:43,719 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:35:43,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2021-11-23 03:35:43,758 INFO L354 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2021-11-23 03:35:43,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2021-11-23 03:35:43,855 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:35:43,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-11-23 03:35:43,866 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:35:43,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-11-23 03:35:43,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:43,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:35:43,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:35:43,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:35:43,937 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:35:43,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:35:43,950 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:35:43,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:35:44,001 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:35:44,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 46 [2021-11-23 03:35:44,012 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:35:44,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 35 [2021-11-23 03:35:44,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-11-23 03:35:44,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-11-23 03:35:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 03:35:44,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:35:46,145 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2021-11-23 03:35:48,164 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2021-11-23 03:35:50,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-23 03:35:52,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_10 Int)) (= 0 (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_12 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-23 03:35:54,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_10 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_12 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|))))) is different from false [2021-11-23 03:35:56,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (v_subst_10 Int)) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|))) is different from false [2021-11-23 03:35:59,446 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (v_subst_10 Int)) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|))) is different from false [2021-11-23 03:36:01,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 v_subst_17))))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_subst_10 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))))) (store .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-23 03:36:04,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 v_subst_17))))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_subst_10 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 0))))) (store .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|))) is different from false [2021-11-23 03:36:07,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (and (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_subst_10 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 0))))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int)) (= 0 (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 v_subst_17))))) (store .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|))) is different from false [2021-11-23 03:36:09,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 v_subst_17))))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 4 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) 0 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_subst_10 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 0))))) (store .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 4 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) 0 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) is different from false [2021-11-23 03:36:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 22 not checked. [2021-11-23 03:36:11,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441917427] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:36:11,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601102193] [2021-11-23 03:36:11,671 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-23 03:36:11,671 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:36:11,671 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:36:11,672 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:36:11,672 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:36:11,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:11,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:11,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:36:11,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:36:11,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:12,017 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 03:36:12,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 03:36:12,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-23 03:36:12,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:36:12,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:36:12,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:12,202 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-23 03:36:12,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 221 [2021-11-23 03:36:12,259 INFO L354 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-11-23 03:36:12,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 220 treesize of output 237 [2021-11-23 03:36:12,433 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:36:12,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 219 [2021-11-23 03:36:12,458 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-23 03:36:12,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 232 [2021-11-23 03:36:12,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:12,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:12,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:36:12,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:36:12,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:36:12,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:12,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:12,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:36:12,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:36:12,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:36:12,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:36:12,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:12,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:12,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:36:12,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:12,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:36:12,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:12,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:36:12,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:12,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:12,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:36:12,922 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:36:15,670 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9507#(and (<= (+ |ULTIMATE.start_sll_append_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~temp~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_append_~temp~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (or (not (= |ULTIMATE.start_sll_append_~temp~0#1.base| 0)) (not (= |ULTIMATE.start_sll_append_~temp~0#1.offset| 0))) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= 0 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2021-11-23 03:36:15,670 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:36:15,670 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:36:15,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 16] total 33 [2021-11-23 03:36:15,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959749809] [2021-11-23 03:36:15,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:36:15,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-23 03:36:15,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:36:15,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-23 03:36:15,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1033, Unknown=11, NotChecked=836, Total=2070 [2021-11-23 03:36:15,672 INFO L87 Difference]: Start difference. First operand 228 states and 284 transitions. Second operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:36:17,692 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 v_subst_17))))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 4 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) 0 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_subst_10 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 0))))) (store .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 4 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) 0 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) is different from false [2021-11-23 03:36:19,709 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (and (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_subst_10 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 0))))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int)) (= 0 (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)))) (store .cse9 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse9 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 v_subst_17))))) (store .cse8 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse8 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse6 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse6 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|))))) is different from false [2021-11-23 03:36:21,735 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 v_subst_17))))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_subst_10 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse9 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse9 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 0))))) (store .cse8 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse8 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse6 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse6 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|))))) is different from false [2021-11-23 03:36:23,754 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 v_subst_17))))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_subst_10 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))))) (store .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse4 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) is different from false [2021-11-23 03:36:25,769 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (v_subst_10 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_51|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse5 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse5 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select .cse0 0) 0))) is different from false [2021-11-23 03:36:27,782 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_14 Int) (v_subst_13 Int) (v_subst_12 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_13 v_subst_14))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_subst_15 Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (v_subst_16 Int) (v_subst_10 Int)) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) v_subst_15 v_subst_16))))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-11-23 03:36:29,792 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_10 Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_12 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_50|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|))))) (= (select .cse5 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse5 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select .cse0 0) 0))) is different from false [2021-11-23 03:36:31,806 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_9 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int) (v_subst_10 Int)) (= 0 (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_9 v_subst_10))))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_subst_12 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_11 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) v_subst_11 v_subst_12))))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-11-23 03:36:33,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse2 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse3 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) is different from false [2021-11-23 03:36:35,827 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse0 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select .cse1 |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2021-11-23 03:36:37,858 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= (select .cse0 0) 0))) is different from false [2021-11-23 03:36:39,876 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= (select .cse0 0) 0))) is different from false [2021-11-23 03:36:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:36:40,479 INFO L93 Difference]: Finished difference Result 356 states and 441 transitions. [2021-11-23 03:36:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-23 03:36:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-23 03:36:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:36:40,481 INFO L225 Difference]: With dead ends: 356 [2021-11-23 03:36:40,481 INFO L226 Difference]: Without dead ends: 356 [2021-11-23 03:36:40,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 49.7s TimeCoverageRelationStatistics Valid=270, Invalid=1439, Unknown=23, NotChecked=2300, Total=4032 [2021-11-23 03:36:40,484 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 76 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1307 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 03:36:40,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 1181 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 492 Invalid, 0 Unknown, 1307 Unchecked, 0.4s Time] [2021-11-23 03:36:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-11-23 03:36:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 230. [2021-11-23 03:36:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 200 states have (on average 1.43) internal successors, (286), 229 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:36:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2021-11-23 03:36:40,493 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 29 [2021-11-23 03:36:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:36:40,493 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2021-11-23 03:36:40,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:36:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2021-11-23 03:36:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 03:36:40,495 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:36:40,495 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:36:40,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 03:36:40,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:36:40,699 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:36:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:36:40,700 INFO L85 PathProgramCache]: Analyzing trace with hash -473142425, now seen corresponding path program 1 times [2021-11-23 03:36:40,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:36:40,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537112152] [2021-11-23 03:36:40,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:36:40,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:36:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:36:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 03:36:40,861 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:36:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537112152] [2021-11-23 03:36:40,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537112152] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:36:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595536994] [2021-11-23 03:36:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:36:40,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:36:40,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:36:40,863 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:36:40,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 03:36:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:36:40,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 03:36:40,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:36:40,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:41,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:41,073 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 03:36:41,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-11-23 03:36:41,080 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:36:41,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-11-23 03:36:41,176 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 03:36:41,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 25 [2021-11-23 03:36:41,306 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 03:36:41,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2021-11-23 03:36:41,415 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 03:36:41,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 32 [2021-11-23 03:36:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 03:36:41,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:36:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 03:36:48,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595536994] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:36:48,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1443553605] [2021-11-23 03:36:48,435 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-11-23 03:36:48,435 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:36:48,435 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:36:48,436 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:36:48,436 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:36:48,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:48,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:48,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:36:48,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:36:48,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:48,762 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:36:48,767 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:36:48,769 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:36:48,808 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 03:36:48,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 03:36:48,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-23 03:36:48,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:36:48,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:48,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:36:48,981 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:36:48,985 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:36:48,990 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:36:49,079 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-23 03:36:49,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 224 [2021-11-23 03:36:49,138 INFO L354 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-11-23 03:36:49,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 240 [2021-11-23 03:36:49,385 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:36:49,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 229 [2021-11-23 03:36:49,410 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-23 03:36:49,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 258 [2021-11-23 03:36:49,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:49,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:36:49,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:36:49,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:36:49,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:49,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:36:49,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:49,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:49,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:36:49,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:49,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:36:49,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:49,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:36:49,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:49,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:49,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:49,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:49,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:36:49,879 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:36:49,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:36:49,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:49,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:49,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:36:49,929 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:36:49,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:36:50,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:50,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:36:50,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:50,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:36:50,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:50,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:36:50,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:36:50,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:36:50,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:36:50,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:36:50,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:50,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:36:50,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:50,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:50,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:36:50,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:50,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:36:50,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:50,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:36:50,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:50,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:50,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:50,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:50,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:36:50,710 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:36:50,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:36:50,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:50,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:50,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:36:50,740 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:36:50,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:36:51,017 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:36:51,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 202 treesize of output 207 [2021-11-23 03:36:51,052 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-11-23 03:36:51,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 201 treesize of output 216 [2021-11-23 03:36:52,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:36:52,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:52,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:36:52,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:52,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:36:52,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:52,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:36:52,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:36:52,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:36:52,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:36:52,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:52,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:36:52,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:52,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:52,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:36:52,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:52,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:52,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:36:52,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:52,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:36:52,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:52,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:52,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:36:52,665 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:36:52,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:36:52,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:36:52,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:52,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:52,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:36:52,715 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:36:52,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:36:52,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:52,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:36:52,997 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:36:55,555 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10366#(and (< (select |#length| |ULTIMATE.start_main_~#head~1#1.base|) (+ |ULTIMATE.start_main_~#head~1#1.offset| 4)) (= 5 |ULTIMATE.start_main_~max~0#1|) (< |ULTIMATE.start_main_~max~0#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (= 3 |ULTIMATE.start_main_~min~0#1|) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2021-11-23 03:36:55,555 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:36:55,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:36:55,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 12 [2021-11-23 03:36:55,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139061655] [2021-11-23 03:36:55,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:36:55,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-23 03:36:55,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:36:55,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-23 03:36:55,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=573, Unknown=1, NotChecked=0, Total=702 [2021-11-23 03:36:55,558 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand has 14 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:37:12,018 INFO L93 Difference]: Finished difference Result 385 states and 482 transitions. [2021-11-23 03:37:12,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 03:37:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 03:37:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:37:12,021 INFO L225 Difference]: With dead ends: 385 [2021-11-23 03:37:12,021 INFO L226 Difference]: Without dead ends: 385 [2021-11-23 03:37:12,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 77 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=186, Invalid=801, Unknown=5, NotChecked=0, Total=992 [2021-11-23 03:37:12,023 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 280 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:37:12,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 453 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 155 Invalid, 0 Unknown, 154 Unchecked, 0.2s Time] [2021-11-23 03:37:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-11-23 03:37:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 300. [2021-11-23 03:37:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 270 states have (on average 1.3555555555555556) internal successors, (366), 299 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 366 transitions. [2021-11-23 03:37:12,033 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 366 transitions. Word has length 36 [2021-11-23 03:37:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:37:12,033 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 366 transitions. [2021-11-23 03:37:12,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 366 transitions. [2021-11-23 03:37:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 03:37:12,035 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:37:12,035 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:37:12,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 03:37:12,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-23 03:37:12,246 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:37:12,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:37:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash 576811425, now seen corresponding path program 1 times [2021-11-23 03:37:12,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:37:12,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940784704] [2021-11-23 03:37:12,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:12,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:37:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-23 03:37:12,319 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:37:12,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940784704] [2021-11-23 03:37:12,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940784704] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:37:12,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:37:12,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 03:37:12,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701670424] [2021-11-23 03:37:12,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:37:12,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:37:12,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:37:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:37:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:37:12,322 INFO L87 Difference]: Start difference. First operand 300 states and 366 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:37:12,378 INFO L93 Difference]: Finished difference Result 298 states and 364 transitions. [2021-11-23 03:37:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:37:12,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-23 03:37:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:37:12,380 INFO L225 Difference]: With dead ends: 298 [2021-11-23 03:37:12,380 INFO L226 Difference]: Without dead ends: 298 [2021-11-23 03:37:12,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:37:12,381 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 145 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:37:12,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 49 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:37:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-23 03:37:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2021-11-23 03:37:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 269 states have (on average 1.3494423791821561) internal successors, (363), 296 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 363 transitions. [2021-11-23 03:37:12,389 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 363 transitions. Word has length 38 [2021-11-23 03:37:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:37:12,390 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 363 transitions. [2021-11-23 03:37:12,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 363 transitions. [2021-11-23 03:37:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 03:37:12,391 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:37:12,391 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:37:12,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-23 03:37:12,392 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:37:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:37:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash 701135266, now seen corresponding path program 1 times [2021-11-23 03:37:12,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:37:12,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663163277] [2021-11-23 03:37:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:12,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:37:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-23 03:37:12,445 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:37:12,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663163277] [2021-11-23 03:37:12,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663163277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:37:12,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:37:12,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:37:12,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272889213] [2021-11-23 03:37:12,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:37:12,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:37:12,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:37:12,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:37:12,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:37:12,448 INFO L87 Difference]: Start difference. First operand 297 states and 363 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:37:12,560 INFO L93 Difference]: Finished difference Result 349 states and 411 transitions. [2021-11-23 03:37:12,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:37:12,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-23 03:37:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:37:12,563 INFO L225 Difference]: With dead ends: 349 [2021-11-23 03:37:12,563 INFO L226 Difference]: Without dead ends: 349 [2021-11-23 03:37:12,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-23 03:37:12,564 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 209 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:37:12,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 104 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:37:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-11-23 03:37:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 295. [2021-11-23 03:37:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 267 states have (on average 1.344569288389513) internal successors, (359), 294 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 359 transitions. [2021-11-23 03:37:12,586 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 359 transitions. Word has length 39 [2021-11-23 03:37:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:37:12,586 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 359 transitions. [2021-11-23 03:37:12,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 359 transitions. [2021-11-23 03:37:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 03:37:12,589 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:37:12,589 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:37:12,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-23 03:37:12,590 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:37:12,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:37:12,590 INFO L85 PathProgramCache]: Analyzing trace with hash 265070343, now seen corresponding path program 1 times [2021-11-23 03:37:12,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:37:12,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094544379] [2021-11-23 03:37:12,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:12,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:37:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-23 03:37:12,689 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:37:12,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094544379] [2021-11-23 03:37:12,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094544379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:37:12,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:37:12,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:37:12,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139169598] [2021-11-23 03:37:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:37:12,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:37:12,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:37:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:37:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:37:12,692 INFO L87 Difference]: Start difference. First operand 295 states and 359 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:37:12,866 INFO L93 Difference]: Finished difference Result 332 states and 414 transitions. [2021-11-23 03:37:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:37:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-23 03:37:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:37:12,869 INFO L225 Difference]: With dead ends: 332 [2021-11-23 03:37:12,869 INFO L226 Difference]: Without dead ends: 332 [2021-11-23 03:37:12,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-23 03:37:12,870 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 38 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:37:12,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 208 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:37:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-23 03:37:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 322. [2021-11-23 03:37:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 294 states have (on average 1.3843537414965987) internal successors, (407), 321 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 407 transitions. [2021-11-23 03:37:12,879 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 407 transitions. Word has length 40 [2021-11-23 03:37:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:37:12,879 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 407 transitions. [2021-11-23 03:37:12,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 407 transitions. [2021-11-23 03:37:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 03:37:12,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:37:12,881 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:37:12,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-23 03:37:12,881 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:37:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:37:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash 265072649, now seen corresponding path program 1 times [2021-11-23 03:37:12,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:37:12,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326735036] [2021-11-23 03:37:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:12,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:37:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 03:37:12,967 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:37:12,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326735036] [2021-11-23 03:37:12,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326735036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:37:12,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:37:12,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:37:12,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084807675] [2021-11-23 03:37:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:37:12,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:37:12,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:37:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:37:12,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:37:12,969 INFO L87 Difference]: Start difference. First operand 322 states and 407 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:37:13,157 INFO L93 Difference]: Finished difference Result 415 states and 533 transitions. [2021-11-23 03:37:13,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:37:13,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-23 03:37:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:37:13,160 INFO L225 Difference]: With dead ends: 415 [2021-11-23 03:37:13,160 INFO L226 Difference]: Without dead ends: 415 [2021-11-23 03:37:13,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-23 03:37:13,160 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 405 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:37:13,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 189 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:37:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-11-23 03:37:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 346. [2021-11-23 03:37:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 318 states have (on average 1.4056603773584906) internal successors, (447), 345 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 447 transitions. [2021-11-23 03:37:13,171 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 447 transitions. Word has length 40 [2021-11-23 03:37:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:37:13,171 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 447 transitions. [2021-11-23 03:37:13,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 447 transitions. [2021-11-23 03:37:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 03:37:13,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:37:13,172 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:37:13,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-23 03:37:13,173 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:37:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:37:13,173 INFO L85 PathProgramCache]: Analyzing trace with hash 260355583, now seen corresponding path program 1 times [2021-11-23 03:37:13,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:37:13,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614737764] [2021-11-23 03:37:13,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:13,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:37:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 03:37:13,281 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:37:13,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614737764] [2021-11-23 03:37:13,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614737764] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:37:13,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:37:13,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:37:13,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999765063] [2021-11-23 03:37:13,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:37:13,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:37:13,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:37:13,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:37:13,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:37:13,284 INFO L87 Difference]: Start difference. First operand 346 states and 447 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:37:13,633 INFO L93 Difference]: Finished difference Result 496 states and 627 transitions. [2021-11-23 03:37:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:37:13,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-23 03:37:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:37:13,637 INFO L225 Difference]: With dead ends: 496 [2021-11-23 03:37:13,637 INFO L226 Difference]: Without dead ends: 496 [2021-11-23 03:37:13,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-11-23 03:37:13,638 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 528 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:37:13,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 194 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:37:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-11-23 03:37:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 353. [2021-11-23 03:37:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 326 states have (on average 1.401840490797546) internal successors, (457), 352 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 457 transitions. [2021-11-23 03:37:13,649 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 457 transitions. Word has length 40 [2021-11-23 03:37:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:37:13,650 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 457 transitions. [2021-11-23 03:37:13,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 457 transitions. [2021-11-23 03:37:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 03:37:13,651 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:37:13,651 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:37:13,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-23 03:37:13,652 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:37:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:37:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash 260355584, now seen corresponding path program 1 times [2021-11-23 03:37:13,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:37:13,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407603657] [2021-11-23 03:37:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:13,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:37:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 03:37:13,776 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:37:13,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407603657] [2021-11-23 03:37:13,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407603657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:37:13,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:37:13,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:37:13,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752543893] [2021-11-23 03:37:13,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:37:13,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:37:13,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:37:13,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:37:13,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:37:13,778 INFO L87 Difference]: Start difference. First operand 353 states and 457 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:37:14,059 INFO L93 Difference]: Finished difference Result 421 states and 543 transitions. [2021-11-23 03:37:14,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:37:14,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-23 03:37:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:37:14,061 INFO L225 Difference]: With dead ends: 421 [2021-11-23 03:37:14,061 INFO L226 Difference]: Without dead ends: 421 [2021-11-23 03:37:14,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-23 03:37:14,062 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 535 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:37:14,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 156 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:37:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-11-23 03:37:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 355. [2021-11-23 03:37:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 328 states have (on average 1.3932926829268293) internal successors, (457), 354 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 457 transitions. [2021-11-23 03:37:14,071 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 457 transitions. Word has length 40 [2021-11-23 03:37:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:37:14,072 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 457 transitions. [2021-11-23 03:37:14,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 457 transitions. [2021-11-23 03:37:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 03:37:14,073 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:37:14,073 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:37:14,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-23 03:37:14,073 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:37:14,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:37:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1846869453, now seen corresponding path program 1 times [2021-11-23 03:37:14,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:37:14,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595516412] [2021-11-23 03:37:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:14,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:37:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-23 03:37:14,236 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:37:14,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595516412] [2021-11-23 03:37:14,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595516412] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:37:14,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85799850] [2021-11-23 03:37:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:14,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:37:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:37:14,237 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:37:14,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 03:37:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:14,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-23 03:37:14,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:37:14,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:14,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-23 03:37:14,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:14,495 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-11-23 03:37:14,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:37:14,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:14,561 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-11-23 03:37:14,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 27 [2021-11-23 03:37:14,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:14,618 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-11-23 03:37:14,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:37:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 03:37:14,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:37:32,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_63| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_27| Int)) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_27| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_63| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_63|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_27|))) is different from false [2021-11-23 03:37:33,068 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 03:37:33,069 INFO L388 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 35 treesize of output 34 [2021-11-23 03:37:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 47 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 03:37:33,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85799850] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:37:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1814690735] [2021-11-23 03:37:33,119 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-23 03:37:33,119 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:37:33,120 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:37:33,120 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:37:33,120 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:37:33,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:37:33,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2021-11-23 03:37:33,274 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:37:33,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2021-11-23 03:37:33,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:37:33,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-23 03:37:33,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:37:33,518 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:37:33,685 INFO L354 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2021-11-23 03:37:33,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 414 treesize of output 422 [2021-11-23 03:37:33,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:33,992 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 03:37:33,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 459 treesize of output 442 [2021-11-23 03:37:34,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:37:34,042 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-11-23 03:37:34,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 444 treesize of output 442 [2021-11-23 03:37:34,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:37:34,094 INFO L354 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2021-11-23 03:37:34,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 473 treesize of output 471 [2021-11-23 03:37:34,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:37:34,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:37:34,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:37:34,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:34,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:37:34,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:34,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:34,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:37:34,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:34,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:37:34,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:34,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:37:34,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:34,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:34,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:34,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:37:34,462 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:37:34,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:37:34,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:34,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:34,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:34,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:37:34,502 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:37:34,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:37:34,688 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-11-23 03:37:34,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 205 treesize of output 220 [2021-11-23 03:37:34,716 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:37:34,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 216 [2021-11-23 03:37:35,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:37:35,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:37:35,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:35,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:37:35,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:37:35,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:37:35,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:37:35,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:37:35,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:35,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:37:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:35,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:37:35,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:35,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:35,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:37:35,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:35,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:37:35,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:35,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:35,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:35,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:37:35,812 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:37:35,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:37:35,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:35,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:35,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:35,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:37:35,850 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:37:35,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:37:36,004 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-11-23 03:37:36,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 131 [2021-11-23 03:37:36,028 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:37:36,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 127 [2021-11-23 03:37:36,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:37:36,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:37:36,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:37:36,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:37:36,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:36,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:37:36,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:37:36,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:37:36,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:37:36,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:37:36,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:36,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:37:36,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:36,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:36,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:37:36,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:36,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:37:36,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:36,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:37:36,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:36,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:36,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:36,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:37:36,591 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:37:36,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:37:36,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:37:36,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:36,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:37:36,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:37:36,631 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:37:36,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:37:36,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:37:36,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:37:36,768 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:37:39,093 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15692#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2021-11-23 03:37:39,093 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:37:39,093 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:37:39,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2021-11-23 03:37:39,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682782583] [2021-11-23 03:37:39,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:37:39,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-23 03:37:39,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:37:39,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-23 03:37:39,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=764, Unknown=5, NotChecked=58, Total=992 [2021-11-23 03:37:39,095 INFO L87 Difference]: Start difference. First operand 355 states and 457 transitions. Second operand has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:37:39,343 INFO L93 Difference]: Finished difference Result 377 states and 476 transitions. [2021-11-23 03:37:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:37:39,343 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-23 03:37:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:37:39,346 INFO L225 Difference]: With dead ends: 377 [2021-11-23 03:37:39,346 INFO L226 Difference]: Without dead ends: 377 [2021-11-23 03:37:39,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=201, Invalid=854, Unknown=5, NotChecked=62, Total=1122 [2021-11-23 03:37:39,347 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 656 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:37:39,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 105 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 134 Invalid, 0 Unknown, 134 Unchecked, 0.2s Time] [2021-11-23 03:37:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-23 03:37:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 354. [2021-11-23 03:37:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 328 states have (on average 1.375) internal successors, (451), 353 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 451 transitions. [2021-11-23 03:37:39,357 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 451 transitions. Word has length 41 [2021-11-23 03:37:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:37:39,358 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 451 transitions. [2021-11-23 03:37:39,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:37:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 451 transitions. [2021-11-23 03:37:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 03:37:39,359 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:37:39,359 INFO L514 BasicCegarLoop]: trace histogram [4, 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-11-23 03:37:39,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 03:37:39,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:37:39,579 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:37:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:37:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1093730647, now seen corresponding path program 1 times [2021-11-23 03:37:39,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:37:39,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762491148] [2021-11-23 03:37:39,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:39,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:37:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-23 03:37:39,899 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:37:39,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762491148] [2021-11-23 03:37:39,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762491148] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:37:39,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853211276] [2021-11-23 03:37:39,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:39,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:37:39,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:37:39,900 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:37:39,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 03:37:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:39,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-23 03:37:39,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:37:39,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:37:40,027 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 03:37:40,027 INFO L388 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-11-23 03:37:40,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:37:40,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-23 03:37:40,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:37:40,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:37:40,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:37:40,459 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:37:40,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2021-11-23 03:37:40,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-23 03:37:40,747 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:37:40,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 19 [2021-11-23 03:37:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 03:37:40,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:37:40,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2021-11-23 03:37:51,275 WARN L227 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 34 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 03:38:00,019 INFO L354 Elim1Store]: treesize reduction 196, result has 54.3 percent of original size [2021-11-23 03:38:00,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 10139 treesize of output 9879 [2021-11-23 03:38:00,619 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-23 03:38:00,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [673090891] [2021-11-23 03:38:00,622 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2021-11-23 03:38:00,622 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:38:00,622 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:38:00,623 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:38:00,623 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:38:00,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:00,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:00,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:38:00,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:00,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:00,907 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:00,911 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:00,913 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:00,947 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 03:38:00,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 03:38:00,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-23 03:38:00,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:01,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:38:01,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:38:01,094 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:01,104 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:01,106 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:01,177 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-23 03:38:01,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 224 [2021-11-23 03:38:01,260 INFO L354 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-11-23 03:38:01,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 240 [2021-11-23 03:38:01,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:01,818 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:01,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 398 treesize of output 397 [2021-11-23 03:38:01,842 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:01,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 396 [2021-11-23 03:38:02,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:02,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:38:02,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:02,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:02,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:02,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:02,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:02,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:02,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:02,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:02,193 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:02,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:38:02,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:02,222 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:38:02,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:38:02,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:02,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:02,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:02,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:02,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:02,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:38:02,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:38:02,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:02,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:02,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:38:02,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:02,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:02,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:02,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:02,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:02,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:02,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:02,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:02,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:02,782 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:02,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:38:02,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:02,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:02,810 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:38:02,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:38:03,019 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:38:03,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 154 [2021-11-23 03:38:03,052 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-11-23 03:38:03,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 148 treesize of output 163 [2021-11-23 03:38:03,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:03,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:03,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:03,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:38:03,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:38:03,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:03,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:03,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:38:03,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:03,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:03,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:03,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:03,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:03,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:03,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:03,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:03,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:03,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:03,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:03,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:03,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:03,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:03,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:03,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:03,757 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:38:03,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:38:03,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:03,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:03,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:03,789 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:03,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:38:03,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:03,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:04,059 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:38:07,066 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16669#(and (= |ULTIMATE.start_sll_length_#in~head#1.base| |ULTIMATE.start_sll_length_~head#1.base|) (<= 3 |ULTIMATE.start_main_~min~0#1|) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_main_~max~0#1| 5) (= |ULTIMATE.start_main_#t~mem22#1.offset| |ULTIMATE.start_sll_length_#in~head#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_sll_length_~head#1.base|) 1)) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#head~1#1.base|) |ULTIMATE.start_main_~#head~1#1.offset|)) (= |ULTIMATE.start_sll_length_~len~0#1| 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#head~1#1.base|) |ULTIMATE.start_main_~#head~1#1.offset|) |ULTIMATE.start_main_~ptr~0#1.base|) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 5 |ULTIMATE.start_main_~max~0#1|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (= |ULTIMATE.start_main_#t~mem22#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= 0 |ULTIMATE.start_main_~#head~1#1.offset|) (= |ULTIMATE.start_main_~min~0#1| |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~min~0#1| 3) (<= |#NULL.base| 0) (or (not (= |ULTIMATE.start_sll_length_~head#1.offset| 0)) (not (= |ULTIMATE.start_sll_length_~head#1.base| 0))) (<= (+ |ULTIMATE.start_main_~#head~1#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#head~1#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#head~1#1.base|) 1) (= |ULTIMATE.start_sll_length_#in~head#1.base| |ULTIMATE.start_main_#t~mem22#1.base|) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_sll_length_~head#1.offset| |ULTIMATE.start_sll_length_#in~head#1.offset|) (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= 0 |#StackHeapBarrier|))' at error location [2021-11-23 03:38:07,066 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:38:07,066 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:38:07,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-11-23 03:38:07,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139606322] [2021-11-23 03:38:07,066 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-23 03:38:07,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 03:38:07,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:38:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 03:38:07,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1640, Unknown=2, NotChecked=0, Total=1806 [2021-11-23 03:38:07,068 INFO L87 Difference]: Start difference. First operand 354 states and 451 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:38:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:38:07,819 INFO L93 Difference]: Finished difference Result 503 states and 636 transitions. [2021-11-23 03:38:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-23 03:38:07,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-23 03:38:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:38:07,822 INFO L225 Difference]: With dead ends: 503 [2021-11-23 03:38:07,822 INFO L226 Difference]: Without dead ends: 503 [2021-11-23 03:38:07,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=319, Invalid=2649, Unknown=2, NotChecked=0, Total=2970 [2021-11-23 03:38:07,823 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 1034 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 03:38:07,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1034 Valid, 336 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 03:38:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-11-23 03:38:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 358. [2021-11-23 03:38:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 332 states have (on average 1.3825301204819278) internal successors, (459), 357 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:38:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 459 transitions. [2021-11-23 03:38:07,832 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 459 transitions. Word has length 42 [2021-11-23 03:38:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:38:07,833 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 459 transitions. [2021-11-23 03:38:07,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:38:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 459 transitions. [2021-11-23 03:38:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 03:38:07,834 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:38:07,834 INFO L514 BasicCegarLoop]: trace histogram [4, 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-11-23 03:38:07,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 03:38:08,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:38:08,047 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:38:08,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:38:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1093730648, now seen corresponding path program 1 times [2021-11-23 03:38:08,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:38:08,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787002417] [2021-11-23 03:38:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:38:08,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:38:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:38:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 03:38:08,404 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:38:08,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787002417] [2021-11-23 03:38:08,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787002417] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:38:08,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034948240] [2021-11-23 03:38:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:38:08,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:38:08,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:38:08,406 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:38:08,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 03:38:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:38:08,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 63 conjunts are in the unsatisfiable core [2021-11-23 03:38:08,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:38:08,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:08,528 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 03:38:08,528 INFO L388 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-11-23 03:38:08,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:08,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-23 03:38:08,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:08,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:08,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:38:08,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:08,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-23 03:38:09,008 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:38:09,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 [2021-11-23 03:38:09,017 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-11-23 03:38:09,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 68 [2021-11-23 03:38:09,445 INFO L354 Elim1Store]: treesize reduction 52, result has 5.5 percent of original size [2021-11-23 03:38:09,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 56 [2021-11-23 03:38:09,457 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-11-23 03:38:09,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 30 [2021-11-23 03:38:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 03:38:09,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:38:09,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 782 treesize of output 778 [2021-11-23 03:38:12,333 INFO L354 Elim1Store]: treesize reduction 968, result has 38.0 percent of original size [2021-11-23 03:38:12,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 18 new quantified variables, introduced 136 case distinctions, treesize of input 86202 treesize of output 81164 [2021-11-23 03:38:17,757 WARN L227 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 1064 DAG size of output: 1042 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-23 03:38:21,457 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-23 03:38:21,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [708377870] [2021-11-23 03:38:21,460 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2021-11-23 03:38:21,460 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:38:21,460 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:38:21,460 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:38:21,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:38:21,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:21,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:21,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:38:21,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:21,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:21,758 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:21,761 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:21,763 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:21,792 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 03:38:21,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-23 03:38:21,816 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 03:38:21,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 03:38:21,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:21,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:38:21,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:38:21,930 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:21,937 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:21,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:22,014 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-23 03:38:22,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 224 [2021-11-23 03:38:22,065 INFO L354 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-11-23 03:38:22,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 240 [2021-11-23 03:38:22,275 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:38:22,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 222 [2021-11-23 03:38:22,306 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-11-23 03:38:22,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 247 [2021-11-23 03:38:22,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:22,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:22,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:38:22,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:22,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:22,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:22,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:22,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:22,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:22,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:22,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:22,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:22,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:22,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:22,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:22,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:22,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:22,721 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:22,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:38:22,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:22,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:22,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:22,764 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:38:22,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:38:22,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:23,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:23,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:23,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:23,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:23,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:23,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:38:23,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:38:23,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:38:23,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:23,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:23,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:23,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:23,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:23,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:23,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:23,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:23,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:23,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:23,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:23,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:23,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:23,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:23,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:23,436 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:38:23,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:38:23,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:23,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:23,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:23,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:23,482 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:23,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:38:23,725 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-11-23 03:38:23,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 202 treesize of output 217 [2021-11-23 03:38:23,750 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:38:23,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 213 [2021-11-23 03:38:24,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:24,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:24,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:24,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:38:24,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:38:24,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:24,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:24,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:24,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:38:24,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:24,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:24,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:25,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:25,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:25,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:25,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:25,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:25,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:25,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:25,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:25,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:25,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:25,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:25,165 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:25,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:38:25,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:25,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:25,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:25,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:25,218 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:38:25,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:38:25,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:25,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:25,474 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:38:28,984 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17799#(and (= |ULTIMATE.start_sll_length_#in~head#1.base| |ULTIMATE.start_sll_length_~head#1.base|) (= |ULTIMATE.start_main_#t~mem22#1.offset| |ULTIMATE.start_sll_length_#in~head#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (or (< |ULTIMATE.start_sll_length_~head#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_length_~head#1.base|) (+ |ULTIMATE.start_sll_length_~head#1.offset| 4))) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#head~1#1.base|) |ULTIMATE.start_main_~#head~1#1.offset|)) (= |ULTIMATE.start_sll_length_~len~0#1| 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#head~1#1.base|) |ULTIMATE.start_main_~#head~1#1.offset|) |ULTIMATE.start_main_~ptr~0#1.base|) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (= |ULTIMATE.start_main_#t~mem22#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_main_~min~0#1| |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~min~0#1|) (or (not (= |ULTIMATE.start_sll_length_~head#1.offset| 0)) (not (= |ULTIMATE.start_sll_length_~head#1.base| 0))) (<= (+ |ULTIMATE.start_main_~#head~1#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#head~1#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#head~1#1.base|) 1) (= |ULTIMATE.start_sll_length_#in~head#1.base| |ULTIMATE.start_main_#t~mem22#1.base|) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (= |ULTIMATE.start_sll_length_~head#1.offset| |ULTIMATE.start_sll_length_#in~head#1.offset|) (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2021-11-23 03:38:28,985 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:38:28,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:38:28,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-11-23 03:38:28,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780146697] [2021-11-23 03:38:28,985 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-23 03:38:28,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-23 03:38:28,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:38:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-23 03:38:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1727, Unknown=0, NotChecked=0, Total=1892 [2021-11-23 03:38:28,987 INFO L87 Difference]: Start difference. First operand 358 states and 459 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:38:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:38:30,062 INFO L93 Difference]: Finished difference Result 550 states and 685 transitions. [2021-11-23 03:38:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-23 03:38:30,063 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-23 03:38:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:38:30,065 INFO L225 Difference]: With dead ends: 550 [2021-11-23 03:38:30,065 INFO L226 Difference]: Without dead ends: 550 [2021-11-23 03:38:30,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=395, Invalid=3145, Unknown=0, NotChecked=0, Total=3540 [2021-11-23 03:38:30,067 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1286 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 03:38:30,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1286 Valid, 247 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 03:38:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-11-23 03:38:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 358. [2021-11-23 03:38:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 332 states have (on average 1.3765060240963856) internal successors, (457), 357 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:38:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 457 transitions. [2021-11-23 03:38:30,077 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 457 transitions. Word has length 42 [2021-11-23 03:38:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:38:30,077 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 457 transitions. [2021-11-23 03:38:30,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:38:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 457 transitions. [2021-11-23 03:38:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 03:38:30,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:38:30,078 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:38:30,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-11-23 03:38:30,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:38:30,283 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:38:30,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:38:30,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1019870606, now seen corresponding path program 1 times [2021-11-23 03:38:30,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:38:30,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457278659] [2021-11-23 03:38:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:38:30,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:38:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:38:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 03:38:30,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:38:30,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457278659] [2021-11-23 03:38:30,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457278659] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:38:30,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448980557] [2021-11-23 03:38:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:38:30,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:38:30,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:38:30,719 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:38:30,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 03:38:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:38:30,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-23 03:38:30,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:38:31,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-23 03:38:31,125 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-23 03:38:31,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 03:38:31,206 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:38:31,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2021-11-23 03:38:31,280 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:31,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-23 03:38:31,345 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:38:31,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2021-11-23 03:38:31,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:31,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:31,484 INFO L354 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2021-11-23 03:38:31,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 34 [2021-11-23 03:38:31,573 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-23 03:38:31,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-11-23 03:38:31,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:31,824 INFO L354 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2021-11-23 03:38:31,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 61 [2021-11-23 03:38:32,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:32,163 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-11-23 03:38:32,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 70 [2021-11-23 03:38:32,786 INFO L354 Elim1Store]: treesize reduction 76, result has 35.6 percent of original size [2021-11-23 03:38:32,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 109 [2021-11-23 03:38:34,127 INFO L354 Elim1Store]: treesize reduction 32, result has 50.8 percent of original size [2021-11-23 03:38:34,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 106 [2021-11-23 03:38:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 03:38:34,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:38:39,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| 1))) (or (= (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (store (select .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) 1) (not (= (select .cse0 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1))))) is different from false [2021-11-23 03:38:41,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| 1))) (or (= (select .cse0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))))) (store .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (store (select .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) 1) (not (= (select .cse0 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1))))) is different from false [2021-11-23 03:38:43,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1)) (= (select .cse0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|))))) (store .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (store (select .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) 1) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|)))) is different from false [2021-11-23 03:38:45,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.offset_84| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_108| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1)) (= (select .cse0 (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|) |v_ULTIMATE.start_sll_create_~new_head~0#1.offset_84| |v_ULTIMATE.start_sll_create_~head~0#1.base_108|))))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|))))) (store .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (store (select .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) 1) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|)))) is different from false [2021-11-23 03:38:47,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.offset_84| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_75| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_108| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse0 (store (store (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_75| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| 1))) (or (= (select .cse0 (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_75| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_75|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|) |v_ULTIMATE.start_sll_create_~new_head~0#1.offset_84| |v_ULTIMATE.start_sll_create_~head~0#1.base_108|))))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|))))) (store .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (store (select .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) 1) (not (= (select .cse0 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_75|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|)))) is different from false [2021-11-23 03:38:50,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.offset_84| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_33| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_75| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_108| Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_33|) (= (select (store (store (store (store |c_#valid| |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_33| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_75| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| 1) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_75| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_75|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|) |v_ULTIMATE.start_sll_create_~new_head~0#1.offset_84| |v_ULTIMATE.start_sll_create_~head~0#1.base_108|))))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_73|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|))))) (store .cse0 |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_33| (store (store (store (select .cse0 |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_33|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|)) 1) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_75|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_74|))) is different from false [2021-11-23 03:38:50,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72763 treesize of output 72699 [2021-11-23 03:38:50,716 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-23 03:38:50,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [889016094] [2021-11-23 03:38:50,718 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-23 03:38:50,718 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:38:50,719 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:38:50,719 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:38:50,719 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:38:50,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 03:38:50,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2021-11-23 03:38:50,873 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:50,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2021-11-23 03:38:50,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:38:50,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:50,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 03:38:51,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:51,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:51,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2021-11-23 03:38:51,154 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 03:38:51,409 INFO L354 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2021-11-23 03:38:51,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 414 treesize of output 422 [2021-11-23 03:38:51,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:51,809 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-11-23 03:38:51,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 457 [2021-11-23 03:38:51,834 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:51,884 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-11-23 03:38:51,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 464 treesize of output 462 [2021-11-23 03:38:51,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:51,937 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 03:38:51,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 493 treesize of output 476 [2021-11-23 03:38:52,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:52,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:38:52,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:52,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:52,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:52,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:52,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:52,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:52,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:52,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:52,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:52,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:52,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:52,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:52,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:52,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:52,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:52,444 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:52,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:38:52,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:52,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:52,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:52,485 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:38:52,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:38:52,658 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-11-23 03:38:52,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 205 treesize of output 220 [2021-11-23 03:38:52,687 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:38:52,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 216 [2021-11-23 03:38:53,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:53,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:53,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:38:53,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:53,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:38:53,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:38:53,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:53,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:53,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:53,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:53,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:53,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:53,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:53,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:53,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:53,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:53,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:53,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:53,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:53,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:53,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:53,705 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:38:53,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:38:53,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:53,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:53,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:53,736 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:53,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:38:53,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:53,863 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-11-23 03:38:53,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 131 [2021-11-23 03:38:53,888 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:38:53,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 127 [2021-11-23 03:38:54,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:54,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:54,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 03:38:54,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:38:54,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:54,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:54,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:54,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-23 03:38:54,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:54,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:38:54,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:54,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:54,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:54,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:54,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 03:38:54,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:54,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:54,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:54,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:54,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-23 03:38:54,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 03:38:54,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:54,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:54,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:54,557 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-23 03:38:54,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2021-11-23 03:38:54,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:54,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:38:54,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 03:38:54,590 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:38:54,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 03:38:54,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:54,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 03:38:54,707 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:38:57,879 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18986#(and (<= (+ |ULTIMATE.start_sll_append_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~temp~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_append_~temp~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (or (not (= |ULTIMATE.start_sll_append_~temp~0#1.base| 0)) (not (= |ULTIMATE.start_sll_append_~temp~0#1.offset| 0))) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2021-11-23 03:38:57,880 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:38:57,880 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:38:57,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-11-23 03:38:57,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668703394] [2021-11-23 03:38:57,881 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-23 03:38:57,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-23 03:38:57,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:38:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-23 03:38:57,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1951, Unknown=8, NotChecked=570, Total=2756 [2021-11-23 03:38:57,883 INFO L87 Difference]: Start difference. First operand 358 states and 457 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:38:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:38:58,658 INFO L93 Difference]: Finished difference Result 499 states and 639 transitions. [2021-11-23 03:38:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 03:38:58,659 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-23 03:38:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:38:58,661 INFO L225 Difference]: With dead ends: 499 [2021-11-23 03:38:58,661 INFO L226 Difference]: Without dead ends: 499 [2021-11-23 03:38:58,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=328, Invalid=2550, Unknown=8, NotChecked=654, Total=3540 [2021-11-23 03:38:58,663 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 729 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 03:38:58,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 332 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 03:38:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-11-23 03:38:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 359. [2021-11-23 03:38:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 335 states have (on average 1.364179104477612) internal successors, (457), 358 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:38:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 457 transitions. [2021-11-23 03:38:58,672 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 457 transitions. Word has length 43 [2021-11-23 03:38:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:38:58,672 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 457 transitions. [2021-11-23 03:38:58,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:38:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 457 transitions. [2021-11-23 03:38:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 03:38:58,673 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:38:58,673 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:38:58,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-23 03:38:58,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-23 03:38:58,887 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-23 03:38:58,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:38:58,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1019870605, now seen corresponding path program 1 times [2021-11-23 03:38:58,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:38:58,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777971705] [2021-11-23 03:38:58,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:38:58,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:38:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:38:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 53 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 03:38:59,430 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:38:59,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777971705] [2021-11-23 03:38:59,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777971705] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:38:59,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087860620] [2021-11-23 03:38:59,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:38:59,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:38:59,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:38:59,431 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:38:59,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65778ea3-f03f-4225-b933-51c6f50ead1a/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 03:38:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:38:59,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 99 conjunts are in the unsatisfiable core [2021-11-23 03:38:59,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:38:59,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:59,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:38:59,689 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 03:38:59,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-23 03:38:59,704 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 03:38:59,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 31 [2021-11-23 03:38:59,851 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-23 03:38:59,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 53 [2021-11-23 03:38:59,868 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 03:38:59,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2021-11-23 03:39:00,128 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 03:39:00,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 62 [2021-11-23 03:39:00,149 INFO L354 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2021-11-23 03:39:00,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 57 [2021-11-23 03:39:01,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:39:01,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2021-11-23 03:39:01,502 INFO L354 Elim1Store]: treesize reduction 128, result has 16.3 percent of original size [2021-11-23 03:39:01,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 78 [2021-11-23 03:39:01,578 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 03:39:01,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 03:39:02,082 INFO L354 Elim1Store]: treesize reduction 178, result has 14.4 percent of original size [2021-11-23 03:39:02,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 86 [2021-11-23 03:39:02,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:39:02,171 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 03:39:02,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-11-23 03:39:02,480 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:39:02,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 94 [2021-11-23 03:39:02,494 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:39:02,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 95 [2021-11-23 03:39:02,773 INFO L354 Elim1Store]: treesize reduction 236, result has 12.9 percent of original size [2021-11-23 03:39:02,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 112 treesize of output 129 [2021-11-23 03:39:02,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:39:02,802 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-23 03:39:02,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 119 [2021-11-23 03:39:04,664 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-23 03:39:04,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 133 [2021-11-23 03:39:04,682 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:39:04,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 107 [2021-11-23 03:39:04,996 INFO L354 Elim1Store]: treesize reduction 236, result has 12.9 percent of original size [2021-11-23 03:39:04,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 112 treesize of output 129 [2021-11-23 03:39:05,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:39:05,029 INFO L354 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2021-11-23 03:39:05,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 125 [2021-11-23 03:39:05,434 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:39:05,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 119 [2021-11-23 03:39:05,449 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:39:05,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 120 [2021-11-23 03:39:05,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2021-11-23 03:39:05,943 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-23 03:39:05,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 72 [2021-11-23 03:39:06,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 126 [2021-11-23 03:39:06,074 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 03:39:06,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 137 [2021-11-23 03:39:06,372 INFO L354 Elim1Store]: treesize reduction 96, result has 18.6 percent of original size [2021-11-23 03:39:06,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 177 [2021-11-23 03:39:06,399 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-23 03:39:06,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 158 [2021-11-23 03:39:06,410 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-11-23 03:39:06,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 156 [2021-11-23 03:39:06,860 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-23 03:39:06,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 130 [2021-11-23 03:39:06,875 INFO L354 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2021-11-23 03:39:06,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 101 [2021-11-23 03:39:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:39:07,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:39:15,259 WARN L227 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 03:39:57,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_82| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_84| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_83| Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_84| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_83| 1))) (or (not (= (select (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_82| 1) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1)) (and (forall ((v_subst_19 Int) (v_subst_18 Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| Int) (v_subst_21 Int) (|ULTIMATE.start_sll_create_~head~0#1.base| Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse2 (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= (+ (select (select (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_84| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_84|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_83| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_83|) 0 v_subst_21))))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_82| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_82|) 0 0))))) (store .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (store (select .cse1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4) (select (store (store (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_84| 8) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_83| 8) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_82| 8) (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_84| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_84|) 0 |ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_83| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_83|) 0 v_subst_19))))) (store .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_82| (store (select .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_82|) 0 v_subst_18))))) (store .cse5 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (store (select .cse5 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))))) (forall ((|ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| Int) (|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| Int) (v_subst_20 Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (<= 0 (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_84| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_84|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse10 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_83| (store (select .cse10 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_83|) 0 v_subst_20))))) (store .cse9 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_82| (store (select .cse9 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_82|) 0 0))))) (store .cse8 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (store (select .cse8 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4) |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0))) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_83|) (not (= (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_82|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_82|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_84|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_84|) 0))))) is different from false [2021-11-23 03:40:06,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1217570 treesize of output 1217442 [2021-11-23 03:40:07,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9542981897 treesize of output 9534589193