./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P --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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:21:19,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:21:19,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:21:19,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:21:19,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:21:19,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:21:19,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:21:19,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:21:19,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:21:19,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:21:19,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:21:19,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:21:19,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:21:19,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:21:19,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:21:19,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:21:19,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:21:19,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:21:19,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:21:19,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:21:19,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:21:19,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:21:19,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:21:19,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:21:19,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:21:19,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:21:19,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:21:19,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:21:19,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:21:19,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:21:19,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:21:19,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:21:19,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:21:19,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:21:19,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:21:19,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:21:19,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:21:19,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:21:19,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:21:19,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:21:19,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:21:19,709 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-21 01:21:19,742 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:21:19,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:21:19,743 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:21:19,743 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:21:19,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:21:19,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:21:19,744 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:21:19,745 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:21:19,745 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:21:19,745 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:21:19,745 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:21:19,746 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:21:19,746 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:21:19,746 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:21:19,746 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:21:19,747 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:21:19,747 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:21:19,747 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:21:19,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 01:21:19,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 01:21:19,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:21:19,749 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:21:19,749 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 01:21:19,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:21:19,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:21:19,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:21:19,750 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 01:21:19,750 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 01:21:19,751 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 01:21:19,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:21:19,751 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 01:21:19,751 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:21:19,752 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:21:19,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:21:19,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:21:19,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:21:19,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:21:19,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:21:19,764 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:21:19,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:21:19,770 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:21:19,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:21:19,771 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_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/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_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2021-11-21 01:21:20,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:21:20,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:21:20,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:21:20,116 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:21:20,117 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:21:20,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2021-11-21 01:21:20,228 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/data/0c55663aa/7005c84f1e1c4253ad3c33f3bc4d0d62/FLAG06baee39c [2021-11-21 01:21:20,828 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:21:20,828 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2021-11-21 01:21:20,841 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/data/0c55663aa/7005c84f1e1c4253ad3c33f3bc4d0d62/FLAG06baee39c [2021-11-21 01:21:21,094 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/data/0c55663aa/7005c84f1e1c4253ad3c33f3bc4d0d62 [2021-11-21 01:21:21,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:21:21,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:21:21,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:21:21,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:21:21,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:21:21,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fc4ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21, skipping insertion in model container [2021-11-21 01:21:21,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:21:21,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:21:21,500 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_4ecab92e-4487-4e21-88f4-a0cb498042b7/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2021-11-21 01:21:21,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:21:21,523 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:21:21,606 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_4ecab92e-4487-4e21-88f4-a0cb498042b7/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2021-11-21 01:21:21,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:21:21,640 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:21:21,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21 WrapperNode [2021-11-21 01:21:21,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:21:21,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:21:21,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:21:21,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:21:21,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,697 INFO L137 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2021-11-21 01:21:21,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:21:21,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:21:21,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:21:21,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:21:21,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:21:21,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:21:21,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:21:21,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:21:21,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (1/1) ... [2021-11-21 01:21:21,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:21:21,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:21:21,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:21:21,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:21:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 01:21:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 01:21:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 01:21:21,870 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 01:21:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 01:21:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:21:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:21:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 01:21:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 01:21:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:21:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 01:21:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:21:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:21:21,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:21:22,074 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:21:22,076 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:21:22,485 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:21:22,541 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:21:22,541 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-21 01:21:22,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:21:22 BoogieIcfgContainer [2021-11-21 01:21:22,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:21:22,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:21:22,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:21:22,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:21:22,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:21:21" (1/3) ... [2021-11-21 01:21:22,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d3e162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:21:22, skipping insertion in model container [2021-11-21 01:21:22,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:21" (2/3) ... [2021-11-21 01:21:22,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d3e162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:21:22, skipping insertion in model container [2021-11-21 01:21:22,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:21:22" (3/3) ... [2021-11-21 01:21:22,554 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2021-11-21 01:21:22,560 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:21:22,560 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2021-11-21 01:21:22,610 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:21:22,618 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-21 01:21:22,618 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-11-21 01:21:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 77 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:21:22,644 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:22,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:21:22,646 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:22,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1977358206, now seen corresponding path program 1 times [2021-11-21 01:21:22,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:21:22,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637931894] [2021-11-21 01:21:22,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:22,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:21:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:22,861 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-21 01:21:22,862 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:21:22,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637931894] [2021-11-21 01:21:22,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637931894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:22,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:21:22,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:21:22,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236909833] [2021-11-21 01:21:22,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:22,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:21:22,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:21:22,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:21:22,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:21:22,902 INFO L87 Difference]: Start difference. First operand has 81 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 77 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:21:22,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:22,979 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2021-11-21 01:21:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:21:22,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 01:21:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:22,991 INFO L225 Difference]: With dead ends: 87 [2021-11-21 01:21:22,991 INFO L226 Difference]: Without dead ends: 85 [2021-11-21 01:21:22,993 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-21 01:21:22,998 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:22,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:21:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-21 01:21:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2021-11-21 01:21:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 38 states have (on average 2.236842105263158) internal successors, (85), 76 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2021-11-21 01:21:23,045 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 6 [2021-11-21 01:21:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:23,046 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2021-11-21 01:21:23,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:21:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2021-11-21 01:21:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:21:23,047 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:23,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:21:23,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:21:23,048 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:23,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2132845308, now seen corresponding path program 1 times [2021-11-21 01:21:23,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:21:23,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904900236] [2021-11-21 01:21:23,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:23,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:21:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:23,107 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-21 01:21:23,107 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:21:23,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904900236] [2021-11-21 01:21:23,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904900236] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:23,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:21:23,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:21:23,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313246410] [2021-11-21 01:21:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:23,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:21:23,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:21:23,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:21:23,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:21:23,111 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:21:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:23,197 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2021-11-21 01:21:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:21:23,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 01:21:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:23,199 INFO L225 Difference]: With dead ends: 78 [2021-11-21 01:21:23,199 INFO L226 Difference]: Without dead ends: 78 [2021-11-21 01:21:23,199 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-21 01:21:23,201 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:23,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 104 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:21:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-21 01:21:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-11-21 01:21:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2021-11-21 01:21:23,212 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 6 [2021-11-21 01:21:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:23,212 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2021-11-21 01:21:23,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:21:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2021-11-21 01:21:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:21:23,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:23,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:21:23,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:21:23,214 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2132845309, now seen corresponding path program 1 times [2021-11-21 01:21:23,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:21:23,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878099687] [2021-11-21 01:21:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:23,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:21:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:23,301 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-21 01:21:23,301 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:21:23,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878099687] [2021-11-21 01:21:23,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878099687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:23,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:21:23,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:21:23,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543628242] [2021-11-21 01:21:23,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:23,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:21:23,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:21:23,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:21:23,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:21:23,305 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:21:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:23,437 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2021-11-21 01:21:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:21:23,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 01:21:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:23,439 INFO L225 Difference]: With dead ends: 76 [2021-11-21 01:21:23,439 INFO L226 Difference]: Without dead ends: 76 [2021-11-21 01:21:23,440 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-21 01:21:23,442 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:23,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:21:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-21 01:21:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-11-21 01:21:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 72 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2021-11-21 01:21:23,453 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 6 [2021-11-21 01:21:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:23,454 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-11-21 01:21:23,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:21:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2021-11-21 01:21:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:21:23,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:23,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:21:23,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 01:21:23,456 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash -399588339, now seen corresponding path program 1 times [2021-11-21 01:21:23,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:21:23,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975650565] [2021-11-21 01:21:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:23,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:21:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:23,582 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-21 01:21:23,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:21:23,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975650565] [2021-11-21 01:21:23,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975650565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:23,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:21:23,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:21:23,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549278922] [2021-11-21 01:21:23,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:23,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:21:23,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:21:23,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:21:23,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:21:23,592 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:21:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:23,842 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2021-11-21 01:21:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:21:23,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 01:21:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:23,845 INFO L225 Difference]: With dead ends: 76 [2021-11-21 01:21:23,846 INFO L226 Difference]: Without dead ends: 76 [2021-11-21 01:21:23,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:21:23,848 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:23,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 212 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:21:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-21 01:21:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-11-21 01:21:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2021-11-21 01:21:23,857 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2021-11-21 01:21:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:23,858 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2021-11-21 01:21:23,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:21:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2021-11-21 01:21:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:21:23,859 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:23,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:21:23,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 01:21:23,859 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:23,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:23,860 INFO L85 PathProgramCache]: Analyzing trace with hash -399588338, now seen corresponding path program 1 times [2021-11-21 01:21:23,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:21:23,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134652937] [2021-11-21 01:21:23,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:23,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:21:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:24,018 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-21 01:21:24,018 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:21:24,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134652937] [2021-11-21 01:21:24,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134652937] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:24,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:21:24,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:21:24,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661240683] [2021-11-21 01:21:24,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:24,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:21:24,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:21:24,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:21:24,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:21:24,021 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:21:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:24,209 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2021-11-21 01:21:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:21:24,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 01:21:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:24,215 INFO L225 Difference]: With dead ends: 75 [2021-11-21 01:21:24,216 INFO L226 Difference]: Without dead ends: 75 [2021-11-21 01:21:24,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:21:24,225 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:24,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 224 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:21:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-21 01:21:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2021-11-21 01:21:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 70 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2021-11-21 01:21:24,253 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2021-11-21 01:21:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:24,254 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2021-11-21 01:21:24,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:21:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2021-11-21 01:21:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 01:21:24,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:24,255 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:21:24,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 01:21:24,256 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:24,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1876340112, now seen corresponding path program 1 times [2021-11-21 01:21:24,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:21:24,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911345619] [2021-11-21 01:21:24,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:24,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:21:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 01:21:24,380 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:21:24,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911345619] [2021-11-21 01:21:24,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911345619] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:21:24,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27565230] [2021-11-21 01:21:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:24,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:21:24,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:21:24,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:21:24,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 01:21:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:24,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:21:24,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:21:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:21:24,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:21:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 01:21:24,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27565230] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:21:24,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [26278446] [2021-11-21 01:21:24,678 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-21 01:21:24,678 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:21:24,683 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:21:24,689 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:21:24,689 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:21:24,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:24,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:24,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2021-11-21 01:21:25,157 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 01:21:25,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 01:21:25,240 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-21 01:21:25,248 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-21 01:21:25,294 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 1 [2021-11-21 01:21:25,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 13 treesize of output 9 [2021-11-21 01:21:25,322 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-21 01:21:25,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:25,370 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 25 treesize of output 13 [2021-11-21 01:21:25,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:25,387 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 25 treesize of output 13 [2021-11-21 01:21:25,410 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-21 01:21:25,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:25,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:25,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 01:21:25,658 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 01:21:25,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 01:21:25,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:25,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:25,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 01:21:26,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:26,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-21 01:21:26,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:21:26,115 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 13 [2021-11-21 01:21:26,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:21:26,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, 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 13 [2021-11-21 01:21:26,727 INFO L354 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-11-21 01:21:26,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 194 [2021-11-21 01:21:27,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:27,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:27,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 01:21:27,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:21:27,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:21:27,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:21:27,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:21:27,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:21:28,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:28,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:28,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 01:21:28,204 INFO L354 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-11-21 01:21:28,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 194 [2021-11-21 01:21:28,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:28,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:28,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 01:21:29,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:21:29,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:21:29,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:21:29,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:21:29,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:21:29,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:29,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:29,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 01:21:29,932 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-21 01:21:29,932 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 223 treesize of output 203 [2021-11-21 01:21:29,952 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 01:21:29,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 204 treesize of output 192 [2021-11-21 01:21:29,967 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 01:21:29,968 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 201 treesize of output 189 [2021-11-21 01:21:30,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:21:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-11-21 01:21:30,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:21:30,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 01:21:30,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:21:30,931 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 27 treesize of output 11 [2021-11-21 01:21:31,889 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 7 treesize of output 3 [2021-11-21 01:21:31,995 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 7 treesize of output 3 [2021-11-21 01:21:32,293 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 7 treesize of output 3 [2021-11-21 01:21:32,342 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 7 treesize of output 3 [2021-11-21 01:21:33,125 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 51 for LOIs [2021-11-21 01:21:34,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:21:34,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-21 01:21:34,872 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Some non-self update cases but no top-level DER relation at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:340) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:278) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-21 01:21:34,880 INFO L158 Benchmark]: Toolchain (without parser) took 13779.02ms. Allocated memory was 90.2MB in the beginning and 197.1MB in the end (delta: 107.0MB). Free memory was 63.9MB in the beginning and 88.3MB in the end (delta: -24.4MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2021-11-21 01:21:34,880 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 90.2MB. Free memory was 62.8MB in the beginning and 62.8MB in the end (delta: 40.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:21:34,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.71ms. Allocated memory is still 90.2MB. Free memory was 63.8MB in the beginning and 58.3MB in the end (delta: 5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-21 01:21:34,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.88ms. Allocated memory is still 90.2MB. Free memory was 58.3MB in the beginning and 56.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:21:34,881 INFO L158 Benchmark]: Boogie Preprocessor took 57.70ms. Allocated memory is still 90.2MB. Free memory was 55.9MB in the beginning and 54.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:21:34,882 INFO L158 Benchmark]: RCFGBuilder took 788.20ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 54.1MB in the beginning and 79.4MB in the end (delta: -25.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2021-11-21 01:21:34,882 INFO L158 Benchmark]: TraceAbstraction took 12332.22ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 79.0MB in the beginning and 88.3MB in the end (delta: -9.3MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2021-11-21 01:21:34,884 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 90.2MB. Free memory was 62.8MB in the beginning and 62.8MB in the end (delta: 40.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.71ms. Allocated memory is still 90.2MB. Free memory was 63.8MB in the beginning and 58.3MB in the end (delta: 5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.88ms. Allocated memory is still 90.2MB. Free memory was 58.3MB in the beginning and 56.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.70ms. Allocated memory is still 90.2MB. Free memory was 55.9MB in the beginning and 54.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 788.20ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 54.1MB in the beginning and 79.4MB in the end (delta: -25.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12332.22ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 79.0MB in the beginning and 88.3MB in the end (delta: -9.3MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Some non-self update cases but no top-level DER relation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Some non-self update cases but no top-level DER relation: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-21 01:21:34,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P --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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:21:37,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:21:37,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:21:37,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:21:37,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:21:37,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:21:37,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:21:37,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:21:37,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:21:37,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:21:37,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:21:37,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:21:37,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:21:37,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:21:37,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:21:37,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:21:37,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:21:37,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:21:37,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:21:37,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:21:37,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:21:37,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:21:37,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:21:37,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:21:37,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:21:37,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:21:37,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:21:37,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:21:37,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:21:37,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:21:37,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:21:37,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:21:37,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:21:37,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:21:37,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:21:37,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:21:37,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:21:37,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:21:37,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:21:37,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:21:37,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:21:37,450 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-21 01:21:37,477 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:21:37,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:21:37,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:21:37,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:21:37,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:21:37,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:21:37,483 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:21:37,483 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:21:37,484 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:21:37,484 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:21:37,485 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:21:37,485 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:21:37,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 01:21:37,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 01:21:37,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:21:37,487 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:21:37,487 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 01:21:37,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:21:37,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:21:37,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:21:37,488 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 01:21:37,489 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 01:21:37,489 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 01:21:37,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:21:37,489 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 01:21:37,489 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 01:21:37,490 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 01:21:37,490 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:21:37,490 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:21:37,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:21:37,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 01:21:37,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:21:37,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:21:37,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:21:37,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:21:37,492 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 01:21:37,493 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 01:21:37,493 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:21:37,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:21:37,493 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/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_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2021-11-21 01:21:37,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:21:37,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:21:37,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:21:37,910 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:21:37,911 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:21:37,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2021-11-21 01:21:37,985 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/data/5aa39c702/244b86dd3c7d404488fed893aec0725b/FLAG294e12206 [2021-11-21 01:21:38,626 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:21:38,630 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2021-11-21 01:21:38,655 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/data/5aa39c702/244b86dd3c7d404488fed893aec0725b/FLAG294e12206 [2021-11-21 01:21:38,922 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/data/5aa39c702/244b86dd3c7d404488fed893aec0725b [2021-11-21 01:21:38,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:21:38,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:21:38,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:21:38,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:21:38,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:21:38,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:21:38" (1/1) ... [2021-11-21 01:21:38,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d788f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:38, skipping insertion in model container [2021-11-21 01:21:38,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:21:38" (1/1) ... [2021-11-21 01:21:38,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:21:38,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:21:39,440 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_4ecab92e-4487-4e21-88f4-a0cb498042b7/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2021-11-21 01:21:39,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:21:39,474 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:21:39,550 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_4ecab92e-4487-4e21-88f4-a0cb498042b7/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2021-11-21 01:21:39,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:21:39,599 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:21:39,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39 WrapperNode [2021-11-21 01:21:39,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:21:39,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:21:39,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:21:39,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:21:39,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (1/1) ... [2021-11-21 01:21:39,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (1/1) ... [2021-11-21 01:21:39,691 INFO L137 Inliner]: procedures = 131, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2021-11-21 01:21:39,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:21:39,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:21:39,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:21:39,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:21:39,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (1/1) ... [2021-11-21 01:21:39,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (1/1) ... [2021-11-21 01:21:39,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (1/1) ... [2021-11-21 01:21:39,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (1/1) ... [2021-11-21 01:21:39,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (1/1) ... [2021-11-21 01:21:39,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (1/1) ... [2021-11-21 01:21:39,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (1/1) ... [2021-11-21 01:21:39,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:21:39,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:21:39,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:21:39,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:21:39,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (1/1) ... [2021-11-21 01:21:39,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:21:39,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:21:39,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:21:39,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:21:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-21 01:21:39,852 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 01:21:39,852 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 01:21:39,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 01:21:39,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:21:39,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:21:39,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 01:21:39,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 01:21:39,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:21:39,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-21 01:21:39,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 01:21:39,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 01:21:39,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:21:39,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:21:39,970 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:21:39,972 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:21:40,565 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:21:40,572 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:21:40,572 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-21 01:21:40,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:21:40 BoogieIcfgContainer [2021-11-21 01:21:40,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:21:40,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:21:40,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:21:40,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:21:40,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:21:38" (1/3) ... [2021-11-21 01:21:40,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420b78d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:21:40, skipping insertion in model container [2021-11-21 01:21:40,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:21:39" (2/3) ... [2021-11-21 01:21:40,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420b78d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:21:40, skipping insertion in model container [2021-11-21 01:21:40,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:21:40" (3/3) ... [2021-11-21 01:21:40,583 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2021-11-21 01:21:40,588 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:21:40,589 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2021-11-21 01:21:40,634 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:21:40,641 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-21 01:21:40,641 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-11-21 01:21:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 01:21:40,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:40,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:21:40,666 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:40,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951417, now seen corresponding path program 1 times [2021-11-21 01:21:40,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:21:40,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165456130] [2021-11-21 01:21:40,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:40,685 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:21:40,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:21:40,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:21:40,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 01:21:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:40,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 01:21:40,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:21:40,861 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-21 01:21:40,881 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-21 01:21:40,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:21:40,940 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-21 01:21:40,942 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:21:40,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165456130] [2021-11-21 01:21:40,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165456130] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:40,943 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:21:40,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 01:21:40,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889146261] [2021-11-21 01:21:40,953 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:40,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:21:40,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:21:40,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:21:40,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:21:40,982 INFO L87 Difference]: Start difference. First operand has 99 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:21:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:41,212 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2021-11-21 01:21:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:21:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-21 01:21:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:41,223 INFO L225 Difference]: With dead ends: 97 [2021-11-21 01:21:41,224 INFO L226 Difference]: Without dead ends: 94 [2021-11-21 01:21:41,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-21 01:21:41,229 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:41,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 158 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:21:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-21 01:21:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-11-21 01:21:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-11-21 01:21:41,268 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 7 [2021-11-21 01:21:41,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:41,268 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-11-21 01:21:41,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:21:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-11-21 01:21:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 01:21:41,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:41,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:21:41,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-21 01:21:41,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:21:41,470 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1814951418, now seen corresponding path program 1 times [2021-11-21 01:21:41,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:21:41,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743026314] [2021-11-21 01:21:41,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:41,473 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:21:41,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:21:41,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:21:41,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 01:21:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:41,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 01:21:41,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:21:41,605 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-21 01:21:41,630 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-21 01:21:41,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:21:41,725 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-21 01:21:41,725 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:21:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743026314] [2021-11-21 01:21:41,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743026314] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:41,726 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:21:41,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-21 01:21:41,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100930072] [2021-11-21 01:21:41,726 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:41,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:21:41,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:21:41,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:21:41,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:21:41,729 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:21:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:42,149 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2021-11-21 01:21:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:21:42,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-21 01:21:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:42,152 INFO L225 Difference]: With dead ends: 92 [2021-11-21 01:21:42,152 INFO L226 Difference]: Without dead ends: 92 [2021-11-21 01:21:42,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-21 01:21:42,154 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:42,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 219 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-21 01:21:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-21 01:21:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-11-21 01:21:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2021-11-21 01:21:42,165 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 7 [2021-11-21 01:21:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:42,166 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2021-11-21 01:21:42,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:21:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2021-11-21 01:21:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:21:42,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:42,167 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:21:42,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:21:42,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:21:42,381 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:42,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390976, now seen corresponding path program 1 times [2021-11-21 01:21:42,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:21:42,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332554104] [2021-11-21 01:21:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:42,386 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:21:42,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:21:42,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:21:42,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 01:21:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:42,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:21:42,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:21:42,480 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-21 01:21:42,536 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-21 01:21:42,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:21:42,634 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-21 01:21:42,634 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:21:42,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332554104] [2021-11-21 01:21:42,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332554104] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:42,635 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:21:42,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-21 01:21:42,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728917925] [2021-11-21 01:21:42,636 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:42,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:21:42,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:21:42,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:21:42,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:21:42,637 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:21:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:43,016 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2021-11-21 01:21:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:21:43,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-11-21 01:21:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:43,020 INFO L225 Difference]: With dead ends: 96 [2021-11-21 01:21:43,020 INFO L226 Difference]: Without dead ends: 96 [2021-11-21 01:21:43,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:21:43,021 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:43,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 329 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-21 01:21:43,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-21 01:21:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2021-11-21 01:21:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2021-11-21 01:21:43,047 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 13 [2021-11-21 01:21:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:43,048 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-11-21 01:21:43,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:21:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2021-11-21 01:21:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:21:43,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:43,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:21:43,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:21:43,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:21:43,263 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:43,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1506390975, now seen corresponding path program 1 times [2021-11-21 01:21:43,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:21:43,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181290920] [2021-11-21 01:21:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:43,266 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:21:43,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:21:43,268 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:21:43,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 01:21:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:43,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 01:21:43,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:21:43,401 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-21 01:21:43,533 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-21 01:21:43,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:21:43,960 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-21 01:21:43,960 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:21:43,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181290920] [2021-11-21 01:21:43,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181290920] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:43,961 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:21:43,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-21 01:21:43,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835893085] [2021-11-21 01:21:43,961 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:43,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 01:21:43,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:21:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 01:21:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:21:43,962 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:21:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:44,826 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2021-11-21 01:21:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:21:44,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-11-21 01:21:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:44,829 INFO L225 Difference]: With dead ends: 95 [2021-11-21 01:21:44,829 INFO L226 Difference]: Without dead ends: 95 [2021-11-21 01:21:44,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:21:44,831 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:44,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 407 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-21 01:21:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-21 01:21:44,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2021-11-21 01:21:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:21:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2021-11-21 01:21:44,852 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 13 [2021-11-21 01:21:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:44,853 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2021-11-21 01:21:44,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:21:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2021-11-21 01:21:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 01:21:44,857 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:44,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:21:44,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 01:21:45,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:21:45,062 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2068593344, now seen corresponding path program 1 times [2021-11-21 01:21:45,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:21:45,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795030203] [2021-11-21 01:21:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:45,064 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:21:45,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:21:45,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:21:45,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 01:21:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:45,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:21:45,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:21:45,161 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-21 01:21:45,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:21:45,218 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-21 01:21:45,219 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:21:45,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795030203] [2021-11-21 01:21:45,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795030203] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:45,219 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:21:45,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 01:21:45,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603192717] [2021-11-21 01:21:45,221 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:45,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:21:45,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:21:45,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:21:45,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:21:45,227 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:21:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:45,247 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2021-11-21 01:21:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 01:21:45,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-11-21 01:21:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:45,250 INFO L225 Difference]: With dead ends: 97 [2021-11-21 01:21:45,250 INFO L226 Difference]: Without dead ends: 97 [2021-11-21 01:21:45,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-21 01:21:45,254 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 8 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:45,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 283 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:21:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-21 01:21:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-11-21 01:21:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:21:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2021-11-21 01:21:45,265 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 15 [2021-11-21 01:21:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:45,265 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2021-11-21 01:21:45,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:21:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2021-11-21 01:21:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 01:21:45,267 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:45,267 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:21:45,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-21 01:21:45,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:21:45,472 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:21:45,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash -888530816, now seen corresponding path program 1 times [2021-11-21 01:21:45,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:21:45,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500599782] [2021-11-21 01:21:45,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:45,474 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:21:45,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:21:45,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:21:45,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 01:21:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:45,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-21 01:21:45,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:21:45,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, 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-21 01:21:45,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 01:21:45,923 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:21:45,923 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 25 treesize of output 32 [2021-11-21 01:21:46,215 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:21:46,215 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 37 treesize of output 33 [2021-11-21 01:21:46,436 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:21:46,437 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 52 treesize of output 63 [2021-11-21 01:21:47,308 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:21:47,308 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 53 treesize of output 64 [2021-11-21 01:21:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:21:47,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:22:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 6 refuted. 13 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:22:31,828 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:22:31,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500599782] [2021-11-21 01:22:31,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500599782] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:22:31,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [809300710] [2021-11-21 01:22:31,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:22:31,829 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:22:31,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:22:31,836 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:22:31,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-21 01:22:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:22:32,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-21 01:22:32,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:22:32,246 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-21 01:22:32,246 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 14 treesize of output 19 [2021-11-21 01:22:32,448 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:22:32,449 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-21 01:22:32,760 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:22:32,760 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 37 [2021-11-21 01:22:33,388 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 01:22:33,388 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 40 treesize of output 34 [2021-11-21 01:22:40,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:22:40,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:22:40,133 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-21 01:22:40,133 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 43 treesize of output 57 [2021-11-21 01:22:41,443 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 01:22:41,443 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 44 treesize of output 38 [2021-11-21 01:22:41,803 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-21 01:22:41,804 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 63 treesize of output 80 [2021-11-21 01:22:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-21 01:22:42,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:22:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 01:22:51,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [809300710] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 01:22:51,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:22:51,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 10, 11] total 29 [2021-11-21 01:22:51,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958677821] [2021-11-21 01:22:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:22:51,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 01:22:51,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:22:51,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 01:22:51,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=707, Unknown=17, NotChecked=0, Total=870 [2021-11-21 01:22:51,383 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:22:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:22:51,571 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2021-11-21 01:22:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 01:22:51,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2021-11-21 01:22:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:22:51,573 INFO L225 Difference]: With dead ends: 107 [2021-11-21 01:22:51,573 INFO L226 Difference]: Without dead ends: 107 [2021-11-21 01:22:51,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 118 SyntacticMatches, 14 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 55.6s TimeCoverageRelationStatistics Valid=146, Invalid=707, Unknown=17, NotChecked=0, Total=870 [2021-11-21 01:22:51,575 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 74 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:22:51,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 184 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2021-11-21 01:22:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-11-21 01:22:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2021-11-21 01:22:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.65) internal successors, (99), 90 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:22:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2021-11-21 01:22:51,588 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 41 [2021-11-21 01:22:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:22:51,589 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2021-11-21 01:22:51,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:22:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2021-11-21 01:22:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 01:22:51,591 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:22:51,597 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:22:51,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-21 01:22:51,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-21 01:22:51,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-21 01:22:51,998 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:22:51,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:22:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash -888530815, now seen corresponding path program 1 times [2021-11-21 01:22:51,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:22:51,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555402387] [2021-11-21 01:22:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:22:52,000 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:22:52,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:22:52,001 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:22:52,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-21 01:22:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:22:52,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-21 01:22:52,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:22:52,240 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-21 01:22:52,258 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-21 01:22:52,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-21 01:22:52,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-21 01:22:52,665 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:22:52,665 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-21 01:22:52,676 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:22:52,677 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 27 treesize of output 23 [2021-11-21 01:22:52,974 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 01:22:52,975 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 14 treesize of output 14 [2021-11-21 01:22:53,331 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:22:53,331 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 29 treesize of output 34 [2021-11-21 01:22:54,402 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-21 01:22:54,403 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 32 [2021-11-21 01:22:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:22:54,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:23:08,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|))) (or (not (bvule |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2| .cse0)) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|)) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_2|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_6|))))))) is different from false [2021-11-21 01:23:58,254 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_61|))) (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_61| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (not (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|)) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))))) is different from true [2021-11-21 01:24:24,147 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_61|))) (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_61| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (not (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|)) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_62|))))))) is different from true [2021-11-21 01:24:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2021-11-21 01:24:24,494 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:24:24,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555402387] [2021-11-21 01:24:24,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555402387] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:24:24,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [248693254] [2021-11-21 01:24:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:24:24,495 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:24:24,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:24:24,497 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:24:24,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-21 01:24:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:24:24,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 01:24:24,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:24:24,823 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-21 01:24:25,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-21 01:24:25,258 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:24:25,258 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 15 treesize of output 17 [2021-11-21 01:24:25,816 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:24:25,817 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 17 treesize of output 13 [2021-11-21 01:24:26,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:24:26,485 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-21 01:24:26,486 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 20 treesize of output 25 [2021-11-21 01:24:27,789 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:24:27,789 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 17 treesize of output 13 [2021-11-21 01:24:28,121 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:24:28,121 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 32 treesize of output 37 [2021-11-21 01:24:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-21 01:24:28,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:26:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 21 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-21 01:26:53,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [248693254] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:26:53,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337891178] [2021-11-21 01:26:53,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:26:53,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:26:53,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:26:53,351 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:26:53,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-21 01:26:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:26:53,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-21 01:26:53,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:26:53,499 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-21 01:26:53,521 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-21 01:26:54,595 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:26:54,596 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 34 treesize of output 36 [2021-11-21 01:26:54,637 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-11-21 01:26:54,638 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 33 treesize of output 36 [2021-11-21 01:26:57,542 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:26:57,543 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 54 treesize of output 59 [2021-11-21 01:26:57,586 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:26:57,586 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 53 treesize of output 51 [2021-11-21 01:27:00,196 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-11-21 01:27:00,196 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 46 [2021-11-21 01:27:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:27:00,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:27:03,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6| .cse0)) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_10|)))) (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_10|))))) is different from false [2021-11-21 01:27:05,901 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_80| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6| .cse0)) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_80| (_ bv8 32)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_10|)) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_6|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_10|))))))) is different from false [2021-11-21 01:27:25,163 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) is different from false [2021-11-21 01:27:27,166 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) is different from true [2021-11-21 01:27:32,386 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_84| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_84|))))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_84| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))))) is different from false [2021-11-21 01:27:44,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (exists ((|v_node_create_~temp~0#1.base_87| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_87|)))) (or (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_87| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))) (= (_ bv0 1) (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_87| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))))) is different from false [2021-11-21 01:27:46,059 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (exists ((|v_node_create_~temp~0#1.base_87| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_87|)))) (or (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_87| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))) (= (_ bv0 1) (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_87| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))))) is different from true [2021-11-21 01:28:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2021-11-21 01:28:50,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337891178] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:28:50,492 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 01:28:50,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11, 10, 13, 12] total 56 [2021-11-21 01:28:50,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329356724] [2021-11-21 01:28:50,493 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 01:28:50,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-11-21 01:28:50,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:28:50,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-11-21 01:28:50,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1980, Unknown=96, NotChecked=808, Total=3192 [2021-11-21 01:28:50,497 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 57 states, 52 states have (on average 3.25) internal successors, (169), 41 states have internal predecessors, (169), 16 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (18), 14 states have call predecessors, (18), 16 states have call successors, (18) [2021-11-21 01:28:52,526 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_61|))) (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_61| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (not (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|)) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_62|))))))) (= |c_#length| |c_old(#length)|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_84| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_84|))))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_84| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))) is different from false [2021-11-21 01:28:54,557 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (= (_ bv0 1) (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_61|))) (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_61| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (not (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|)) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (exists ((|v_node_create_~temp~0#1.base_87| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_87|)))) (or (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_87| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))) (= (_ bv0 1) (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_87| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))))))))) is different from false [2021-11-21 01:28:56,599 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |c_node_create_#res#1.base|))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_61|))) (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_61| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (not (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|)) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|))) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (exists ((|v_node_create_~temp~0#1.base_87| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_87|)))) (or (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_87| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))) (= (_ bv0 1) (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_87| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))))))))) is different from false [2021-11-21 01:29:00,209 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_61|))) (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_61| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (not (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|)) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_62|))))))) (= |c_#length| |c_old(#length)|) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_84| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_84|))))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_84| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))) is different from false [2021-11-21 01:29:02,246 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|))) (= (_ bv0 1) (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_61|))) (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_61| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (not (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|)) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (exists ((|v_node_create_~temp~0#1.base_87| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_87|)))) (or (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_87| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))) (= (_ bv0 1) (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_87| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))))))))) is different from false [2021-11-21 01:29:04,307 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |c_node_create_#res#1.base|))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_61|))) (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_61| (_ bv8 32)) |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (not (bvult |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|)) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|))) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (exists ((|v_node_create_~temp~0#1.base_87| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_87|)))) (or (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_87| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))) (= (_ bv0 1) (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_87| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_53| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_53| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))))))))) is different from false [2021-11-21 01:29:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:29:55,668 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2021-11-21 01:29:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-21 01:29:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 3.25) internal successors, (169), 41 states have internal predecessors, (169), 16 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (18), 14 states have call predecessors, (18), 16 states have call successors, (18) Word has length 41 [2021-11-21 01:29:55,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:29:55,673 INFO L225 Difference]: With dead ends: 164 [2021-11-21 01:29:55,673 INFO L226 Difference]: Without dead ends: 164 [2021-11-21 01:29:55,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 176 SyntacticMatches, 16 SemanticMatches, 67 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 334.9s TimeCoverageRelationStatistics Valid=406, Invalid=2511, Unknown=109, NotChecked=1666, Total=4692 [2021-11-21 01:29:55,678 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 92 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1917 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-21 01:29:55,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 1774 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 1917 Unchecked, 0.8s Time] [2021-11-21 01:29:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-21 01:29:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 108. [2021-11-21 01:29:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:29:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2021-11-21 01:29:55,689 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 41 [2021-11-21 01:29:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:29:55,689 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2021-11-21 01:29:55,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 3.25) internal successors, (169), 41 states have internal predecessors, (169), 16 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (18), 14 states have call predecessors, (18), 16 states have call successors, (18) [2021-11-21 01:29:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2021-11-21 01:29:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-21 01:29:55,692 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:29:55,692 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:29:55,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-21 01:29:55,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-21 01:29:56,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-21 01:29:56,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:29:56,309 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:29:56,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:29:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash -338093919, now seen corresponding path program 1 times [2021-11-21 01:29:56,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:29:56,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080436456] [2021-11-21 01:29:56,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:29:56,310 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:29:56,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:29:56,311 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:29:56,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-21 01:29:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:29:56,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-21 01:29:56,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:29:56,910 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-21 01:29:57,589 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 21 treesize of output 17 [2021-11-21 01:30:00,660 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 01:30:00,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 51 [2021-11-21 01:30:00,708 INFO L354 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-11-21 01:30:00,709 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 48 treesize of output 53 [2021-11-21 01:30:01,135 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 01:30:01,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 40 [2021-11-21 01:30:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 01:30:02,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:30:05,330 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.offset_84| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_91| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_91| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_91| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_91| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_91|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_84|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_84| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8|))))))))) (_ bv1 1)))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8|)))))))))))) is different from false [2021-11-21 01:30:07,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)) (_ bv0 1)) (exists ((|v_node_create_~temp~0#1.offset_84| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_91| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_91| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_91| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_91| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_91|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_84|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_84| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8|))))))))) (_ bv1 1)))))))) is different from false [2021-11-21 01:30:09,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.offset_84| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_91| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_91| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_91| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_91| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_91|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_84|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_84| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8|))))))))) (_ bv1 1)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8|)))))))))))) (_ bv1 1))))) is different from false [2021-11-21 01:30:12,329 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_92| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_92| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_92| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_92|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8|)))))))))))))) (_ bv1 1))) (exists ((|v_node_create_~temp~0#1.offset_84| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_91| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_91| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_91| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_91| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_91|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_84|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_84| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_8|))))))))) (_ bv1 1)))))) (not (bvult |v_node_create_~temp~0#1.base_92| |c_#StackHeapBarrier|)))) is different from true [2021-11-21 01:30:12,354 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 298 treesize of output 286 [2021-11-21 01:30:22,104 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 01:30:22,104 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 85 treesize of output 89 [2021-11-21 01:30:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 6 times theorem prover too weak. 3 trivial. 6 not checked. [2021-11-21 01:30:31,045 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:30:31,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080436456] [2021-11-21 01:30:31,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080436456] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:30:31,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1572723890] [2021-11-21 01:30:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:30:31,046 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:30:31,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:30:31,056 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:30:31,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-11-21 01:30:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:30:31,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-21 01:30:31,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:30:41,866 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-21 01:30:43,579 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 22 treesize of output 18 [2021-11-21 01:30:49,524 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 01:30:49,525 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 2 case distinctions, treesize of input 64 treesize of output 56 [2021-11-21 01:30:49,615 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-21 01:30:49,615 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 53 treesize of output 64 [2021-11-21 01:30:50,568 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 01:30:50,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 51 [2021-11-21 01:30:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 01:30:52,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:31:06,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_95| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_102| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_102| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_102| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_102|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_95|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_95| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_10|))))))))))))) (_ bv1 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_102|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_10|)))))))))) (_ bv1 1))))) is different from false [2021-11-21 01:31:09,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_95| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_102| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_102| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_102| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_102|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_95|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_95| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_10|))))))))))))) (_ bv1 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_102|)))) (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_10|)))))))))))) (_ bv1 1)) (_ bv0 1)))) is different from false [2021-11-21 01:31:11,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_95| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_102| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_102| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_102| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_102|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_95|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_95| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_10|))))))))))))) (_ bv1 1)))) (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_102|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_10|))))))))))))) (_ bv1 1))))) is different from false [2021-11-21 01:32:13,621 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 160 treesize of output 152 [2021-11-21 01:32:30,799 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 01:32:30,799 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 96 treesize of output 114 [2021-11-21 01:32:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2021-11-21 01:32:32,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1572723890] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:32:32,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534482758] [2021-11-21 01:32:32,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:32,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:32:32,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:32:32,124 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:32:32,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ecab92e-4487-4e21-88f4-a0cb498042b7/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-21 01:32:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:32,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-21 01:32:32,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:32:32,271 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-21 01:32:39,203 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:32:39,204 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 21 treesize of output 28 [2021-11-21 01:32:46,645 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-11-21 01:32:46,645 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 48 treesize of output 65 [2021-11-21 01:33:10,402 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 01:33:10,402 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 2 case distinctions, treesize of input 128 treesize of output 112 [2021-11-21 01:33:10,611 INFO L354 Elim1Store]: treesize reduction 89, result has 33.6 percent of original size [2021-11-21 01:33:10,611 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 9 case distinctions, treesize of input 117 treesize of output 148 [2021-11-21 01:33:12,310 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 01:33:12,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 127 [2021-11-21 01:33:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:33:21,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:33:23,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_114| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_106| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_114| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_114| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_114|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_106|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_106| v_DerPreprocessor_5)) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_114|)))))) is different from false [2021-11-21 01:33:25,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_114| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_106| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_114|)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_114| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_106|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_106| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))))))) is different from false [2021-11-21 01:33:27,554 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_114| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_106| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_114|)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_114| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_106|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_106| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))))))) is different from true [2021-11-21 01:33:30,027 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_114| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_106| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_114|)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_114| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_106|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_106| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1))))) is different from false [2021-11-21 01:33:32,037 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_114| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_106| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_114|)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_114| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_106|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_106| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1))))) is different from true [2021-11-21 01:33:34,198 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|))))))))) (_ bv1 1))) (exists ((|v_node_create_~temp~0#1.base_114| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_106| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_114|)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_114| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_106|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_106| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))))) is different from false [2021-11-21 01:33:36,205 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|))))))))) (_ bv1 1))) (exists ((|v_node_create_~temp~0#1.base_114| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_106| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_114|)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_114| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_106|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_106| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))))) is different from true [2021-11-21 01:33:38,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_115| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_115|)))) (exists ((|v_node_create_~temp~0#1.base_114| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_106| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_114|)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_114| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_106|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_106| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))))) is different from false [2021-11-21 01:33:40,700 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_115| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_115|)))) (exists ((|v_node_create_~temp~0#1.base_114| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_106| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_114|)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_114| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_114|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_106|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_106| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_insert_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))))))) is different from true [2021-11-21 01:33:40,716 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 293 treesize of output 281