./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:16:49,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:16:49,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:16:49,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:16:49,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:16:49,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:16:49,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:16:49,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:16:49,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:16:49,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:16:49,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:16:49,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:16:49,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:16:49,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:16:49,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:16:49,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:16:49,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:16:49,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:16:49,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:16:49,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:16:49,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:16:49,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:16:49,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:16:49,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:16:49,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:16:49,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:16:49,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:16:49,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:16:49,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:16:49,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:16:49,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:16:49,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:16:49,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:16:49,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:16:49,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:16:49,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:16:49,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:16:49,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:16:49,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:16:49,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:16:49,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:16:49,429 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-23 02:16:49,480 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:16:49,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:16:49,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:16:49,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:16:49,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:16:49,483 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:16:49,483 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:16:49,483 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:16:49,483 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:16:49,484 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:16:49,485 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:16:49,485 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:16:49,485 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:16:49,485 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:16:49,486 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:16:49,486 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:16:49,486 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:16:49,486 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:16:49,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:16:49,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:16:49,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:16:49,488 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:16:49,488 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:16:49,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:16:49,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:16:49,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:16:49,490 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:16:49,491 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:16:49,491 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:16:49,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:16:49,491 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:16:49,492 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:16:49,492 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:16:49,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:16:49,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:16:49,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:16:49,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:16:49,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:16:49,493 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:16:49,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:16:49,494 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:16:49,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:16:49,494 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_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2021-11-23 02:16:49,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:16:49,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:16:49,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:16:49,792 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:16:49,792 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:16:49,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-23 02:16:49,880 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/data/847be3b02/f1574111170e4052897b33a6c493eed7/FLAG7f3297971 [2021-11-23 02:16:50,538 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:16:50,542 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-23 02:16:50,568 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/data/847be3b02/f1574111170e4052897b33a6c493eed7/FLAG7f3297971 [2021-11-23 02:16:50,784 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/data/847be3b02/f1574111170e4052897b33a6c493eed7 [2021-11-23 02:16:50,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:16:50,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:16:50,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:16:50,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:16:50,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:16:50,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:50" (1/1) ... [2021-11-23 02:16:50,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746b48fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:50, skipping insertion in model container [2021-11-23 02:16:50,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:50" (1/1) ... [2021-11-23 02:16:50,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:16:50,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:16:51,234 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_48ac163b-33ea-4681-b15b-55ab91b4fe12/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-23 02:16:51,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:16:51,256 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:16:51,326 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_48ac163b-33ea-4681-b15b-55ab91b4fe12/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-23 02:16:51,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:16:51,373 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:16:51,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51 WrapperNode [2021-11-23 02:16:51,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:16:51,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:16:51,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:16:51,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:16:51,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (1/1) ... [2021-11-23 02:16:51,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (1/1) ... [2021-11-23 02:16:51,451 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2021-11-23 02:16:51,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:16:51,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:16:51,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:16:51,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:16:51,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (1/1) ... [2021-11-23 02:16:51,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (1/1) ... [2021-11-23 02:16:51,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (1/1) ... [2021-11-23 02:16:51,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (1/1) ... [2021-11-23 02:16:51,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (1/1) ... [2021-11-23 02:16:51,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (1/1) ... [2021-11-23 02:16:51,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (1/1) ... [2021-11-23 02:16:51,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:16:51,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:16:51,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:16:51,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:16:51,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (1/1) ... [2021-11-23 02:16:51,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:16:51,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:51,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:16:51,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 02:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 02:16:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 02:16:51,605 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 02:16:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 02:16:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:16:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:16:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 02:16:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 02:16:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:16:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 02:16:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 02:16:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:16:51,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:16:51,796 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:16:51,798 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:16:52,210 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:16:52,281 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:16:52,281 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 02:16:52,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:52 BoogieIcfgContainer [2021-11-23 02:16:52,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:16:52,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:16:52,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:16:52,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:16:52,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:16:50" (1/3) ... [2021-11-23 02:16:52,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62903117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:16:52, skipping insertion in model container [2021-11-23 02:16:52,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:51" (2/3) ... [2021-11-23 02:16:52,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62903117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:16:52, skipping insertion in model container [2021-11-23 02:16:52,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:52" (3/3) ... [2021-11-23 02:16:52,295 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2021-11-23 02:16:52,300 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:16:52,300 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-11-23 02:16:52,359 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:16:52,370 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:16:52,370 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-11-23 02:16:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 48 states have (on average 2.3125) internal successors, (111), 100 states have internal predecessors, (111), 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-23 02:16:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-23 02:16:52,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:52,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-23 02:16:52,437 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:16:52,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash 224891455, now seen corresponding path program 1 times [2021-11-23 02:16:52,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:52,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892515212] [2021-11-23 02:16:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:52,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:52,637 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:52,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892515212] [2021-11-23 02:16:52,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892515212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:52,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:52,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:16:52,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047624630] [2021-11-23 02:16:52,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:52,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:16:52,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:52,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:16:52,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:52,676 INFO L87 Difference]: Start difference. First operand has 105 states, 48 states have (on average 2.3125) internal successors, (111), 100 states have internal predecessors, (111), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-23 02:16:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:52,811 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-11-23 02:16:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:16:52,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2021-11-23 02:16:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:52,822 INFO L225 Difference]: With dead ends: 103 [2021-11-23 02:16:52,822 INFO L226 Difference]: Without dead ends: 101 [2021-11-23 02:16:52,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:52,828 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:52,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:16:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-23 02:16:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-11-23 02:16:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 96 states have internal predecessors, (104), 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-23 02:16:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2021-11-23 02:16:52,872 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 5 [2021-11-23 02:16:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:52,872 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2021-11-23 02:16:52,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-23 02:16:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2021-11-23 02:16:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-23 02:16:52,873 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:52,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-23 02:16:52,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:16:52,874 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:16:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash 224891456, now seen corresponding path program 1 times [2021-11-23 02:16:52,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:52,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539550337] [2021-11-23 02:16:52,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:52,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:52,928 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:52,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539550337] [2021-11-23 02:16:52,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539550337] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:52,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:52,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:16:52,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572992238] [2021-11-23 02:16:52,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:52,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:16:52,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:16:52,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:52,932 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-23 02:16:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:53,025 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2021-11-23 02:16:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:16:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2021-11-23 02:16:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:53,033 INFO L225 Difference]: With dead ends: 99 [2021-11-23 02:16:53,033 INFO L226 Difference]: Without dead ends: 99 [2021-11-23 02:16:53,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:53,038 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:53,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 147 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:16:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-23 02:16:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-11-23 02:16:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 94 states have internal predecessors, (102), 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-23 02:16:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2021-11-23 02:16:53,060 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 5 [2021-11-23 02:16:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:53,060 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2021-11-23 02:16:53,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-23 02:16:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2021-11-23 02:16:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:16:53,061 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:53,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:53,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 02:16:53,062 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:16:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:53,063 INFO L85 PathProgramCache]: Analyzing trace with hash -739070550, now seen corresponding path program 1 times [2021-11-23 02:16:53,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:53,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169511663] [2021-11-23 02:16:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:53,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:53,166 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:53,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169511663] [2021-11-23 02:16:53,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169511663] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:53,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:53,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:16:53,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761822542] [2021-11-23 02:16:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:53,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:53,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:16:53,169 INFO L87 Difference]: Start difference. First operand 99 states and 108 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-23 02:16:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:53,447 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2021-11-23 02:16:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:53,448 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-23 02:16:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:53,451 INFO L225 Difference]: With dead ends: 103 [2021-11-23 02:16:53,451 INFO L226 Difference]: Without dead ends: 103 [2021-11-23 02:16:53,452 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-23 02:16:53,453 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:53,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 277 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:16:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-23 02:16:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2021-11-23 02:16:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.163265306122449) internal successors, (106), 96 states have internal predecessors, (106), 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-23 02:16:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-11-23 02:16:53,484 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 10 [2021-11-23 02:16:53,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:53,485 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-11-23 02:16:53,485 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-23 02:16:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-11-23 02:16:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:16:53,486 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:53,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:53,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 02:16:53,487 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:16:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash -739070549, now seen corresponding path program 1 times [2021-11-23 02:16:53,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:53,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747251480] [2021-11-23 02:16:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:53,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:53,552 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:53,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747251480] [2021-11-23 02:16:53,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747251480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:53,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:53,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:16:53,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384290001] [2021-11-23 02:16:53,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:53,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:16:53,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:16:53,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:53,558 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-23 02:16:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:53,610 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-11-23 02:16:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:16:53,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-23 02:16:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:53,615 INFO L225 Difference]: With dead ends: 100 [2021-11-23 02:16:53,615 INFO L226 Difference]: Without dead ends: 100 [2021-11-23 02:16:53,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:53,617 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:53,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 176 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:16:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-23 02:16:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-11-23 02:16:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 95 states have internal predecessors, (103), 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-23 02:16:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2021-11-23 02:16:53,636 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 10 [2021-11-23 02:16:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:53,637 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2021-11-23 02:16:53,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-23 02:16:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2021-11-23 02:16:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 02:16:53,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:53,638 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:53,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 02:16:53,639 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:16:53,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1505132138, now seen corresponding path program 1 times [2021-11-23 02:16:53,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:53,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142550899] [2021-11-23 02:16:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:53,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 02:16:53,789 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:53,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142550899] [2021-11-23 02:16:53,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142550899] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:53,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:53,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:16:53,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908886869] [2021-11-23 02:16:53,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:53,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:53,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:53,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:53,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:16:53,799 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:16:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:53,975 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2021-11-23 02:16:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:53,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-23 02:16:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:53,979 INFO L225 Difference]: With dead ends: 100 [2021-11-23 02:16:53,980 INFO L226 Difference]: Without dead ends: 100 [2021-11-23 02:16:53,980 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-23 02:16:53,982 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:53,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 283 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:16:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-23 02:16:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2021-11-23 02:16:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 48 states have (on average 2.125) internal successors, (102), 94 states have internal predecessors, (102), 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-23 02:16:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2021-11-23 02:16:53,991 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 17 [2021-11-23 02:16:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:53,992 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2021-11-23 02:16:53,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:16:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2021-11-23 02:16:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 02:16:53,993 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:53,993 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:53,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 02:16:53,995 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:16:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1505132139, now seen corresponding path program 1 times [2021-11-23 02:16:53,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:53,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303240996] [2021-11-23 02:16:53,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:53,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:16:54,121 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:54,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303240996] [2021-11-23 02:16:54,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303240996] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:54,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:54,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:16:54,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459736326] [2021-11-23 02:16:54,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:54,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:54,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:54,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:54,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:16:54,125 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:16:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:54,334 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2021-11-23 02:16:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:54,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-23 02:16:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:54,335 INFO L225 Difference]: With dead ends: 99 [2021-11-23 02:16:54,335 INFO L226 Difference]: Without dead ends: 99 [2021-11-23 02:16:54,336 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-23 02:16:54,337 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:54,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 307 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:16:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-23 02:16:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-11-23 02:16:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 93 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-23 02:16:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-11-23 02:16:54,345 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 17 [2021-11-23 02:16:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:54,345 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-11-23 02:16:54,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:16:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-11-23 02:16:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 02:16:54,346 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:54,346 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:54,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 02:16:54,347 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:16:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash -971798934, now seen corresponding path program 1 times [2021-11-23 02:16:54,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:54,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241374251] [2021-11-23 02:16:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:54,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:16:54,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:54,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241374251] [2021-11-23 02:16:54,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241374251] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:54,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486436849] [2021-11-23 02:16:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:54,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:54,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:54,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:16:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:54,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-23 02:16:54,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:54,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:16:54,804 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-23 02:16:54,804 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 9 [2021-11-23 02:16:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:16:54,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:16:54,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486436849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:54,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:16:54,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-11-23 02:16:54,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577068532] [2021-11-23 02:16:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:54,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 02:16:54,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:54,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 02:16:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:16:54,897 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:16:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:55,161 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2021-11-23 02:16:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:16:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-11-23 02:16:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:55,163 INFO L225 Difference]: With dead ends: 116 [2021-11-23 02:16:55,163 INFO L226 Difference]: Without dead ends: 116 [2021-11-23 02:16:55,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-23 02:16:55,165 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 90 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:55,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 302 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:16:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-23 02:16:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2021-11-23 02:16:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 92 states have internal predecessors, (100), 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-23 02:16:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-11-23 02:16:55,182 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 19 [2021-11-23 02:16:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:55,182 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-11-23 02:16:55,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:16:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-11-23 02:16:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 02:16:55,183 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:55,183 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:55,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:55,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-23 02:16:55,411 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:16:55,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash -971798933, now seen corresponding path program 1 times [2021-11-23 02:16:55,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:55,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989211134] [2021-11-23 02:16:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:55,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:16:55,611 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:55,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989211134] [2021-11-23 02:16:55,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989211134] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:55,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757898508] [2021-11-23 02:16:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:55,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:55,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:55,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:55,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:16:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:55,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 02:16:55,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:55,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:16:55,869 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-23 02:16:55,869 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 9 [2021-11-23 02:16:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:16:55,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:16:56,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757898508] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:56,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2076856707] [2021-11-23 02:16:56,045 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-23 02:16:56,045 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:16:56,050 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:16:56,055 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:16:56,056 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:16:56,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:56,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:56,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-23 02:16:56,212 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:16:56,212 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 39 treesize of output 45 [2021-11-23 02:16:56,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-23 02:16:56,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:16:56,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:16:56,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:16:56,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 02:16:56,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 02:16:56,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:56,312 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-23 02:16:56,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:56,325 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-23 02:16:56,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:56,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:56,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-23 02:16:56,447 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:16:56,447 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 39 treesize of output 45 [2021-11-23 02:16:56,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:56,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:56,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-23 02:16:56,703 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:16:56,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 27 [2021-11-23 02:16:56,769 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-23 02:16:56,777 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-23 02:16:56,787 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-23 02:16:56,807 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-23 02:16:56,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-23 02:16:56,883 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:16:56,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 27 [2021-11-23 02:16:56,933 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-23 02:16:56,946 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-23 02:16:56,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 7 treesize of output 3 [2021-11-23 02:16:56,970 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-23 02:16:56,980 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-23 02:16:57,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:16:57,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:57,081 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 23 treesize of output 11 [2021-11-23 02:16:57,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 19 treesize of output 11 [2021-11-23 02:16:57,283 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:16:57,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 273 [2021-11-23 02:16:57,592 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-23 02:16:57,602 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-23 02:16:57,613 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-23 02:16:57,624 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-23 02:16:57,638 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-23 02:16:57,651 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:57,655 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:57,658 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:57,660 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:57,662 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:57,797 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:16:57,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 273 [2021-11-23 02:16:58,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-23 02:16:58,069 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-23 02:16:58,081 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-23 02:16:58,092 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-23 02:16:58,103 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-23 02:16:58,129 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,131 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,133 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,136 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,140 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:58,216 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 23 treesize of output 11 [2021-11-23 02:16:58,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:16:58,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:16:58,391 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:16:58,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 273 [2021-11-23 02:16:58,601 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-23 02:16:58,611 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-23 02:16:58,622 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-23 02:16:58,634 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-23 02:16:58,645 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-23 02:16:58,659 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,662 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,664 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,670 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,769 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:16:58,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 273 [2021-11-23 02:16:58,976 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,978 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,981 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,983 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,984 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:16:58,999 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-23 02:16:59,008 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-23 02:16:59,017 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-23 02:16:59,031 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-23 02:16:59,040 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-23 02:16:59,199 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:16:59,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 273 [2021-11-23 02:16:59,416 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:16:59,416 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 39 treesize of output 45 [2021-11-23 02:16:59,428 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 85 for LOIs [2021-11-23 02:16:59,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:00,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-23 02:17:00,013 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.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) 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:119) 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-23 02:17:00,017 INFO L158 Benchmark]: Toolchain (without parser) took 9225.79ms. Allocated memory was 104.9MB in the beginning and 186.6MB in the end (delta: 81.8MB). Free memory was 67.0MB in the beginning and 113.3MB in the end (delta: -46.3MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2021-11-23 02:17:00,018 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:17:00,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.88ms. Allocated memory is still 104.9MB. Free memory was 66.8MB in the beginning and 70.7MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 02:17:00,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.06ms. Allocated memory is still 104.9MB. Free memory was 70.7MB in the beginning and 68.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:17:00,019 INFO L158 Benchmark]: Boogie Preprocessor took 65.55ms. Allocated memory is still 104.9MB. Free memory was 68.5MB in the beginning and 66.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:17:00,019 INFO L158 Benchmark]: RCFGBuilder took 764.25ms. Allocated memory is still 104.9MB. Free memory was 66.5MB in the beginning and 43.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-23 02:17:00,019 INFO L158 Benchmark]: TraceAbstraction took 7731.05ms. Allocated memory was 104.9MB in the beginning and 186.6MB in the end (delta: 81.8MB). Free memory was 43.1MB in the beginning and 113.3MB in the end (delta: -70.2MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2021-11-23 02:17:00,023 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.20ms. Allocated memory is still 104.9MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.88ms. Allocated memory is still 104.9MB. Free memory was 66.8MB in the beginning and 70.7MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.06ms. Allocated memory is still 104.9MB. Free memory was 70.7MB in the beginning and 68.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.55ms. Allocated memory is still 104.9MB. Free memory was 68.5MB in the beginning and 66.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 764.25ms. Allocated memory is still 104.9MB. Free memory was 66.5MB in the beginning and 43.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7731.05ms. Allocated memory was 104.9MB in the beginning and 186.6MB in the end (delta: 81.8MB). Free memory was 43.1MB in the beginning and 113.3MB in the end (delta: -70.2MB). Peak memory consumption was 12.8MB. 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-23 02:17:00,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/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_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:17:02,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:17:02,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:17:02,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:17:02,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:17:02,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:17:02,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:17:02,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:17:02,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:17:02,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:17:02,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:17:02,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:17:02,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:17:02,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:17:02,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:17:02,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:17:02,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:17:02,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:17:02,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:17:02,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:17:02,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:17:02,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:17:02,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:17:02,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:17:02,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:17:02,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:17:02,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:17:02,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:17:02,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:17:02,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:17:02,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:17:02,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:17:02,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:17:02,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:17:02,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:17:02,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:17:02,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:17:02,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:17:02,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:17:02,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:17:02,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:17:02,628 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-23 02:17:02,658 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:17:02,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:17:02,659 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:17:02,659 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:17:02,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:17:02,660 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:17:02,660 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:17:02,660 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:17:02,661 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:17:02,661 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:17:02,661 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:17:02,661 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:17:02,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:17:02,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:17:02,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:17:02,663 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:17:02,663 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:17:02,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:17:02,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:17:02,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:17:02,664 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:17:02,664 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:17:02,664 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:17:02,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:17:02,664 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:17:02,664 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-23 02:17:02,665 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-23 02:17:02,665 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:17:02,665 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:17:02,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:17:02,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 02:17:02,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:17:02,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:17:02,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:17:02,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:17:02,667 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-23 02:17:02,667 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-23 02:17:02,667 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:17:02,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:17:02,667 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_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2021-11-23 02:17:03,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:17:03,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:17:03,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:17:03,097 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:17:03,098 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:17:03,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-23 02:17:03,185 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/data/6d5089111/716ab724f814447e965e55282e18d2e9/FLAG03c5d4ce5 [2021-11-23 02:17:03,798 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:17:03,799 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-23 02:17:03,813 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/data/6d5089111/716ab724f814447e965e55282e18d2e9/FLAG03c5d4ce5 [2021-11-23 02:17:04,146 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/data/6d5089111/716ab724f814447e965e55282e18d2e9 [2021-11-23 02:17:04,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:17:04,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:17:04,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:17:04,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:17:04,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:17:04,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4e36ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04, skipping insertion in model container [2021-11-23 02:17:04,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:17:04,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:17:04,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_48ac163b-33ea-4681-b15b-55ab91b4fe12/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-23 02:17:04,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:17:04,514 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:17:04,559 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_48ac163b-33ea-4681-b15b-55ab91b4fe12/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-23 02:17:04,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:17:04,604 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:17:04,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04 WrapperNode [2021-11-23 02:17:04,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:17:04,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:17:04,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:17:04,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:17:04,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,679 INFO L137 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 148 [2021-11-23 02:17:04,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:17:04,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:17:04,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:17:04,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:17:04,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:17:04,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:17:04,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:17:04,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:17:04,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (1/1) ... [2021-11-23 02:17:04,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:17:04,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:04,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:17:04,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:17:04,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-23 02:17:04,825 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 02:17:04,826 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 02:17:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 02:17:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:17:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:17:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 02:17:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 02:17:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:17:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-23 02:17:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 02:17:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-23 02:17:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:17:04,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:17:05,000 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:17:05,002 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:17:05,636 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:17:05,648 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:17:05,648 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 02:17:05,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:17:05 BoogieIcfgContainer [2021-11-23 02:17:05,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:17:05,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:17:05,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:17:05,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:17:05,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:17:04" (1/3) ... [2021-11-23 02:17:05,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da4e54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:17:05, skipping insertion in model container [2021-11-23 02:17:05,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:04" (2/3) ... [2021-11-23 02:17:05,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da4e54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:17:05, skipping insertion in model container [2021-11-23 02:17:05,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:17:05" (3/3) ... [2021-11-23 02:17:05,660 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2021-11-23 02:17:05,665 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:17:05,666 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-11-23 02:17:05,714 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:17:05,722 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:17:05,722 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-11-23 02:17:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 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-23 02:17:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 02:17:05,748 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:05,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 02:17:05,750 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:17:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash 895367701, now seen corresponding path program 1 times [2021-11-23 02:17:05,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:17:05,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835810395] [2021-11-23 02:17:05,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:05,770 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:17:05,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:17:05,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:17:05,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-23 02:17:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:05,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 02:17:05,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:05,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:17:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:17:06,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:17:06,064 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:17:06,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835810395] [2021-11-23 02:17:06,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835810395] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:06,065 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:06,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-23 02:17:06,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474678012] [2021-11-23 02:17:06,069 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:06,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:17:06,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:17:06,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:17:06,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:17:06,113 INFO L87 Difference]: Start difference. First operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 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) 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-23 02:17:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:06,406 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2021-11-23 02:17:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:17:06,414 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-23 02:17:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:06,422 INFO L225 Difference]: With dead ends: 119 [2021-11-23 02:17:06,422 INFO L226 Difference]: Without dead ends: 116 [2021-11-23 02:17:06,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:17:06,428 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:06,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:17:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-23 02:17:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-11-23 02:17:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.9193548387096775) internal successors, (119), 111 states have internal predecessors, (119), 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-23 02:17:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2021-11-23 02:17:06,475 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 6 [2021-11-23 02:17:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:06,475 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2021-11-23 02:17:06,475 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-23 02:17:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2021-11-23 02:17:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 02:17:06,476 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:06,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 02:17:06,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:06,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:17:06,688 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:17:06,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash 895367702, now seen corresponding path program 1 times [2021-11-23 02:17:06,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:17:06,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046801791] [2021-11-23 02:17:06,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:06,693 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:17:06,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:17:06,694 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:17:06,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-23 02:17:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:06,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:17:06,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:06,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:17:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:17:06,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:17:06,903 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:17:06,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046801791] [2021-11-23 02:17:06,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046801791] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:06,904 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:06,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-23 02:17:06,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240491134] [2021-11-23 02:17:06,915 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:06,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:17:06,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:17:06,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:17:06,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:17:06,918 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-23 02:17:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:07,491 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2021-11-23 02:17:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:17:07,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-23 02:17:07,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:07,495 INFO L225 Difference]: With dead ends: 114 [2021-11-23 02:17:07,495 INFO L226 Difference]: Without dead ends: 114 [2021-11-23 02:17:07,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:17:07,497 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:07,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 263 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 02:17:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-23 02:17:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-11-23 02:17:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 62 states have (on average 1.8870967741935485) internal successors, (117), 109 states have internal predecessors, (117), 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-23 02:17:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2021-11-23 02:17:07,527 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 6 [2021-11-23 02:17:07,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:07,528 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2021-11-23 02:17:07,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-23 02:17:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2021-11-23 02:17:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 02:17:07,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:07,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:17:07,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:07,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:17:07,744 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:17:07,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:07,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1575141079, now seen corresponding path program 1 times [2021-11-23 02:17:07,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:17:07,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663472003] [2021-11-23 02:17:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:07,746 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:17:07,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:17:07,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:17:07,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-23 02:17:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:07,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 02:17:07,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:17:07,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:17:07,932 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:17:07,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663472003] [2021-11-23 02:17:07,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663472003] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:07,938 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:07,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-23 02:17:07,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596943248] [2021-11-23 02:17:07,939 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:07,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:17:07,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:17:07,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:17:07,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:17:07,943 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-23 02:17:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:07,978 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2021-11-23 02:17:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:17:07,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 13 [2021-11-23 02:17:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:07,983 INFO L225 Difference]: With dead ends: 121 [2021-11-23 02:17:07,985 INFO L226 Difference]: Without dead ends: 121 [2021-11-23 02:17:07,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:17:07,987 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 9 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:07,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 350 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:17:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-23 02:17:08,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2021-11-23 02:17:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.873015873015873) internal successors, (118), 110 states have internal predecessors, (118), 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-23 02:17:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2021-11-23 02:17:08,014 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 13 [2021-11-23 02:17:08,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:08,015 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2021-11-23 02:17:08,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-23 02:17:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2021-11-23 02:17:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 02:17:08,017 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:08,017 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:17:08,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:08,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:17:08,228 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:17:08,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:08,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086820, now seen corresponding path program 1 times [2021-11-23 02:17:08,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:17:08,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383401313] [2021-11-23 02:17:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:08,230 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:17:08,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:17:08,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:17:08,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-23 02:17:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:08,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:17:08,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:08,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:17:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:17:08,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:17:08,510 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:17:08,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383401313] [2021-11-23 02:17:08,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383401313] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:08,524 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:08,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-23 02:17:08,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182202323] [2021-11-23 02:17:08,525 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:08,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:17:08,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:17:08,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:17:08,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:17:08,526 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:17:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:09,086 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2021-11-23 02:17:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:17:09,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-23 02:17:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:09,089 INFO L225 Difference]: With dead ends: 115 [2021-11-23 02:17:09,090 INFO L226 Difference]: Without dead ends: 115 [2021-11-23 02:17:09,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:17:09,091 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 12 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:09,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 364 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:17:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-23 02:17:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2021-11-23 02:17:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 109 states have internal predecessors, (117), 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-23 02:17:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2021-11-23 02:17:09,101 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 22 [2021-11-23 02:17:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:09,101 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2021-11-23 02:17:09,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:17:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2021-11-23 02:17:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 02:17:09,103 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:09,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:17:09,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-23 02:17:09,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:17:09,314 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:17:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086819, now seen corresponding path program 1 times [2021-11-23 02:17:09,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:17:09,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094286565] [2021-11-23 02:17:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:09,315 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:17:09,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:17:09,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:17:09,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-23 02:17:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:09,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 02:17:09,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:09,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:17:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:17:09,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:17:10,008 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:17:10,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094286565] [2021-11-23 02:17:10,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094286565] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:10,009 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:10,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-23 02:17:10,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363195944] [2021-11-23 02:17:10,009 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:10,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:17:10,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:17:10,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:17:10,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-23 02:17:10,011 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:17:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:11,332 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2021-11-23 02:17:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:17:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2021-11-23 02:17:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:11,334 INFO L225 Difference]: With dead ends: 114 [2021-11-23 02:17:11,334 INFO L226 Difference]: Without dead ends: 114 [2021-11-23 02:17:11,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 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-23 02:17:11,336 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 22 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:11,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 527 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-23 02:17:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-23 02:17:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2021-11-23 02:17:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 108 states have internal predecessors, (116), 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-23 02:17:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2021-11-23 02:17:11,345 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 22 [2021-11-23 02:17:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:11,345 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2021-11-23 02:17:11,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:17:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2021-11-23 02:17:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 02:17:11,347 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:11,347 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:17:11,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-23 02:17:11,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:17:11,558 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:17:11,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:11,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578181, now seen corresponding path program 1 times [2021-11-23 02:17:11,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:17:11,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161052743] [2021-11-23 02:17:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:11,560 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:17:11,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:17:11,561 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:17:11,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-23 02:17:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:11,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 02:17:11,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:11,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:17:11,901 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:17:11,902 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 23 treesize of output 30 [2021-11-23 02:17:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:17:12,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:17:43,292 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:17:43,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161052743] [2021-11-23 02:17:43,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161052743] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:17:43,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [543397622] [2021-11-23 02:17:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:43,293 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:17:43,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:17:43,300 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:17:43,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-23 02:17:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:43,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 02:17:43,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:43,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:17:47,651 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-23 02:17:47,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-11-23 02:17:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:17:47,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:17:56,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [543397622] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:56,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:17:56,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8, 6] total 18 [2021-11-23 02:17:56,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187017915] [2021-11-23 02:17:56,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:56,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:17:56,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:17:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:17:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=269, Unknown=14, NotChecked=0, Total=342 [2021-11-23 02:17:56,187 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:17:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:58,872 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2021-11-23 02:17:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 02:17:58,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-11-23 02:17:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:58,875 INFO L225 Difference]: With dead ends: 130 [2021-11-23 02:17:58,875 INFO L226 Difference]: Without dead ends: 130 [2021-11-23 02:17:58,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 45.2s TimeCoverageRelationStatistics Valid=69, Invalid=296, Unknown=15, NotChecked=0, Total=380 [2021-11-23 02:17:58,877 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 100 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:58,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 381 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 293 Invalid, 0 Unknown, 44 Unchecked, 0.6s Time] [2021-11-23 02:17:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-23 02:17:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2021-11-23 02:17:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 107 states have internal predecessors, (115), 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-23 02:17:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2021-11-23 02:17:58,886 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 25 [2021-11-23 02:17:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:58,887 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2021-11-23 02:17:58,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:17:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2021-11-23 02:17:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 02:17:58,889 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:58,889 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:17:58,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:59,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:59,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:17:59,296 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:17:59,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:59,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578182, now seen corresponding path program 1 times [2021-11-23 02:17:59,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:17:59,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358545910] [2021-11-23 02:17:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:59,298 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:17:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:17:59,299 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:17:59,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-23 02:17:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:59,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:17:59,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:59,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:17:59,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:17:59,812 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:17:59,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-23 02:17:59,822 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:17:59,823 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 27 [2021-11-23 02:17:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:17:59,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:18:04,777 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) is different from true [2021-11-23 02:18:09,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) is different from false [2021-11-23 02:18:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-23 02:18:13,226 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:18:13,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358545910] [2021-11-23 02:18:13,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358545910] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:18:13,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [38011686] [2021-11-23 02:18:13,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:13,227 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:18:13,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:18:13,232 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:18:13,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-23 02:18:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:13,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:18:13,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:18:13,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:18:13,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:18:13,816 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:18:13,816 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 32 treesize of output 34 [2021-11-23 02:18:13,833 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:18:13,833 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 31 treesize of output 31 [2021-11-23 02:18:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:18:13,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:18:18,765 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) is different from true [2021-11-23 02:18:23,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) is different from false [2021-11-23 02:18:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-23 02:18:23,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [38011686] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:18:23,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863326945] [2021-11-23 02:18:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:23,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:18:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:18:23,913 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:18:23,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:18:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:24,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:18:24,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:18:24,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:18:24,448 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:18:24,449 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 31 treesize of output 33 [2021-11-23 02:18:24,462 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:18:24,462 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 30 treesize of output 30 [2021-11-23 02:18:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:18:24,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:18:42,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) is different from false [2021-11-23 02:18:42,993 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 02:18:42,993 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 34 treesize of output 33 [2021-11-23 02:18:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:18:45,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863326945] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:18:45,323 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:18:45,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 9, 9] total 21 [2021-11-23 02:18:45,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541246157] [2021-11-23 02:18:45,324 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:18:45,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-23 02:18:45,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:18:45,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-23 02:18:45,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=228, Unknown=11, NotChecked=170, Total=462 [2021-11-23 02:18:45,326 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-23 02:18:47,535 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) (= |c_#length| |c_old(#length)|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-23 02:19:11,876 WARN L227 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 66 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:19:13,886 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse2)) (not (bvule .cse2 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse3) (bvule .cse3 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (= |c_node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_node_create_#res#1.base|))) is different from false [2021-11-23 02:19:15,904 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-23 02:19:49,324 WARN L227 SmtUtils]: Spent 22.71s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:19:51,350 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse2)) (not (bvule .cse2 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse3) (bvule .cse3 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (= |c_node_create_#res#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) (= (_ bv8 32) (select |c_#length| |c_node_create_#res#1.base|))) is different from false [2021-11-23 02:19:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:19:52,057 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2021-11-23 02:19:52,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-23 02:19:52,058 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2021-11-23 02:19:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:19:52,060 INFO L225 Difference]: With dead ends: 139 [2021-11-23 02:19:52,060 INFO L226 Difference]: Without dead ends: 139 [2021-11-23 02:19:52,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 99.4s TimeCoverageRelationStatistics Valid=94, Invalid=336, Unknown=26, NotChecked=414, Total=870 [2021-11-23 02:19:52,062 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 6 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 847 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:19:52,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 745 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 847 Unchecked, 0.7s Time] [2021-11-23 02:19:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-23 02:19:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2021-11-23 02:19:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.6428571428571428) internal successors, (138), 128 states have internal predecessors, (138), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:19:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2021-11-23 02:19:52,074 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 25 [2021-11-23 02:19:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:19:52,074 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2021-11-23 02:19:52,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-23 02:19:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2021-11-23 02:19:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 02:19:52,077 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:19:52,077 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:19:52,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:19:52,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:19:52,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:19:52,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:19:52,680 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:19:52,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:19:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash 131514271, now seen corresponding path program 1 times [2021-11-23 02:19:52,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:19:52,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927933174] [2021-11-23 02:19:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:52,681 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:19:52,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:19:52,682 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:19:52,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-23 02:19:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:52,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:19:52,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:19:52,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:19:52,930 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 12 treesize of output 10 [2021-11-23 02:19:53,139 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:19:53,139 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 24 treesize of output 31 [2021-11-23 02:19:53,383 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:19:53,383 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 39 treesize of output 35 [2021-11-23 02:19:53,569 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:19:53,569 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 65 [2021-11-23 02:19:54,435 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:19:54,435 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 50 treesize of output 61 [2021-11-23 02:19:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:19:54,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:20:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:20:41,723 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:20:41,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927933174] [2021-11-23 02:20:41,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927933174] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:20:41,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [664245684] [2021-11-23 02:20:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:20:41,724 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:20:41,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:20:41,726 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:20:41,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-11-23 02:20:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:20:41,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:20:41,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:20:42,183 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-23 02:20:42,183 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-23 02:20:42,371 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:20:42,372 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 20 treesize of output 16 [2021-11-23 02:20:42,619 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:20:42,619 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 25 treesize of output 36 [2021-11-23 02:20:43,009 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-23 02:20:43,009 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 38 treesize of output 32 [2021-11-23 02:20:47,441 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-23 02:20:47,442 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 47 treesize of output 64 [2021-11-23 02:20:48,444 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-23 02:20:48,444 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 42 treesize of output 36 [2021-11-23 02:20:48,757 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-23 02:20:48,758 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 53 treesize of output 70 [2021-11-23 02:20:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:20:49,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:20:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:20:56,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [664245684] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:20:56,263 INFO L186 FreeRefinementEngine]: Found 2 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:20:56,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [10, 10] total 26 [2021-11-23 02:20:56,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546774649] [2021-11-23 02:20:56,264 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:20:56,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-23 02:20:56,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:20:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 02:20:56,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=567, Unknown=23, NotChecked=0, Total=702 [2021-11-23 02:20:56,266 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-23 02:21:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:04,888 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2021-11-23 02:21:04,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:21:04,889 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2021-11-23 02:21:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:04,891 INFO L225 Difference]: With dead ends: 183 [2021-11-23 02:21:04,891 INFO L226 Difference]: Without dead ends: 183 [2021-11-23 02:21:04,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 102 SyntacticMatches, 17 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 63.3s TimeCoverageRelationStatistics Valid=128, Invalid=657, Unknown=27, NotChecked=0, Total=812 [2021-11-23 02:21:04,892 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 78 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:04,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 501 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 235 Unchecked, 0.4s Time] [2021-11-23 02:21:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-23 02:21:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 133. [2021-11-23 02:21:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 124 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:21:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2021-11-23 02:21:04,904 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 37 [2021-11-23 02:21:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:04,905 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2021-11-23 02:21:04,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-23 02:21:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2021-11-23 02:21:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 02:21:04,907 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:04,907 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:21:04,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-23 02:21:05,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2021-11-23 02:21:05,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:21:05,319 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:21:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash 131514272, now seen corresponding path program 1 times [2021-11-23 02:21:05,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:21:05,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731767253] [2021-11-23 02:21:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:05,320 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:21:05,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:21:05,321 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:21:05,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-23 02:21:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:05,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 02:21:05,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:21:05,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-23 02:21:05,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:21:05,564 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 17 treesize of output 15 [2021-11-23 02:21:05,571 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-23 02:21:05,845 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:21:05,845 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 25 treesize of output 27 [2021-11-23 02:21:05,858 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:21:05,858 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 24 treesize of output 20 [2021-11-23 02:21:05,999 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:21:05,999 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-23 02:21:06,294 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:21:06,294 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-23 02:21:07,276 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-23 02:21:07,276 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-23 02:21:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:21:07,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:21:13,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_103| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_103| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|)) (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|)))) (not (bvule |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| .cse0))))) is different from false [2021-11-23 02:21:16,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_106| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 02:22:36,262 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_106| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_111| (_ BitVec 32))) (or (not (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|)) (exists ((|v_node_create_~temp~0#1.base_106| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_110| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_110|))) (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_102| (_ 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_110| (_ bv8 32)) |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))) (bvult |v_node_create_~temp~0#1.base_106| |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_102| (_ 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_111| (_ bv8 32)) |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_111|))))) is different from true [2021-11-23 02:22:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 6 times theorem prover too weak. 0 trivial. 15 not checked. [2021-11-23 02:22:36,276 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:22:36,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731767253] [2021-11-23 02:22:36,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731767253] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:22:36,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1866066253] [2021-11-23 02:22:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:36,277 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:22:36,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:22:36,285 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:22:36,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-11-23 02:22:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:36,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-23 02:22:36,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:22:36,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:22:36,826 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-23 02:22:37,024 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:22:37,025 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-23 02:22:39,394 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:22:39,395 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-23 02:22:41,839 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:22:41,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2021-11-23 02:22:43,834 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:22:43,834 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-23 02:22:44,128 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:22:44,128 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-23 02:22:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:22:44,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:25:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 21 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:25:34,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1866066253] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:25:34,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:25:34,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 12, 10] total 35 [2021-11-23 02:25:34,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839185840] [2021-11-23 02:25:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:25:34,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 02:25:34,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:25:34,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 02:25:34,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=825, Unknown=79, NotChecked=192, Total=1260 [2021-11-23 02:25:34,553 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:25:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:25:35,051 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2021-11-23 02:25:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 02:25:35,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-11-23 02:25:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:25:35,053 INFO L225 Difference]: With dead ends: 133 [2021-11-23 02:25:35,053 INFO L226 Difference]: Without dead ends: 133 [2021-11-23 02:25:35,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 215.8s TimeCoverageRelationStatistics Valid=164, Invalid=825, Unknown=79, NotChecked=192, Total=1260 [2021-11-23 02:25:35,055 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:25:35,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 509 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 190 Unchecked, 0.5s Time] [2021-11-23 02:25:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-23 02:25:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2021-11-23 02:25:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 123 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:25:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2021-11-23 02:25:35,061 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 37 [2021-11-23 02:25:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:25:35,062 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2021-11-23 02:25:35,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:25:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2021-11-23 02:25:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 02:25:35,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:25:35,064 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:25:35,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-11-23 02:25:35,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2021-11-23 02:25:35,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:25:35,477 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:25:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:25:35,477 INFO L85 PathProgramCache]: Analyzing trace with hash 931477670, now seen corresponding path program 1 times [2021-11-23 02:25:35,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:25:35,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174767214] [2021-11-23 02:25:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:25:35,478 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:25:35,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:25:35,479 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:25:35,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-23 02:25:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:25:35,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 02:25:35,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:25:35,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:25:36,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-11-23 02:25:41,308 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:25:41,308 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 66 treesize of output 54 [2021-11-23 02:25:41,373 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-23 02:25:41,374 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 51 treesize of output 62 [2021-11-23 02:25:41,802 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:25:41,803 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 62 treesize of output 46 [2021-11-23 02:25:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:25:42,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:25:45,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) is different from false [2021-11-23 02:25:47,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (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|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) is different from false [2021-11-23 02:25:49,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) is different from false [2021-11-23 02:26:14,839 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 165 treesize of output 157 [2021-11-23 02:26:17,840 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:26:17,840 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 98 treesize of output 116 [2021-11-23 02:26:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-23 02:26:23,026 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:26:23,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174767214] [2021-11-23 02:26:23,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174767214] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:26:23,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [632577280] [2021-11-23 02:26:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:26:23,027 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:26:23,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:26:23,032 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:26:23,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2021-11-23 02:26:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:26:23,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-23 02:26:23,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:26:29,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:26:41,952 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 19 treesize of output 15 [2021-11-23 02:26:42,520 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:26:42,520 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 61 treesize of output 49 [2021-11-23 02:26:42,591 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-23 02:26:42,591 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 46 treesize of output 57 [2021-11-23 02:26:43,725 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:26:43,726 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 51 treesize of output 35 [2021-11-23 02:26:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:26:44,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:26:46,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|)))))) (_ bv1 1))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 02:26:49,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (_ bv1 1) (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|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) is different from false [2021-11-23 02:26:51,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_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.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))) (_ bv1 1))))) is different from false [2021-11-23 02:26:53,991 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_140| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_140|))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_140| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_140| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_140|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|)))))))))) (_ bv1 1))) (not (bvult |v_node_create_~temp~0#1.base_140| |c_#StackHeapBarrier|)) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))))) is different from true [2021-11-23 02:26:54,005 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 165 treesize of output 157 [2021-11-23 02:26:57,622 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:26:57,622 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 97 treesize of output 115 [2021-11-23 02:27:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-23 02:27:00,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [632577280] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:27:00,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846874398] [2021-11-23 02:27:00,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:27:00,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:27:00,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:27:00,208 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:27:00,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-23 02:27:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:27:00,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-23 02:27:00,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:27:11,851 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 17 treesize of output 13 [2021-11-23 02:27:12,424 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:27:12,424 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 63 treesize of output 51 [2021-11-23 02:27:12,508 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-23 02:27:12,509 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 48 treesize of output 59 [2021-11-23 02:27:12,919 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:27:12,919 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 62 treesize of output 46 [2021-11-23 02:27:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 02:27:13,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:27:15,783 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))))) is different from false [2021-11-23 02:27:18,251 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (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|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|)))))))) (_ bv1 1)) (_ bv0 1)))) is different from false [2021-11-23 02:27:20,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|)))))))))) (_ bv1 1))))) is different from false [2021-11-23 02:27:45,376 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 161 treesize of output 153 [2021-11-23 02:27:50,781 INFO L354 Elim1Store]: treesize reduction -10, result has 120.4 percent of original size [2021-11-23 02:27:50,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 163 [2021-11-23 02:27:54,196 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:27:54,196 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 49 treesize of output 1 [2021-11-23 02:27:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2021-11-23 02:27:54,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846874398] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:27:54,241 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:27:54,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 16, 17, 16] total 57 [2021-11-23 02:27:54,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742136896] [2021-11-23 02:27:54,242 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:27:54,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-11-23 02:27:54,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:27:54,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-11-23 02:27:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2007, Unknown=34, NotChecked=1010, Total=3306 [2021-11-23 02:27:54,244 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 58 states, 53 states have (on average 2.207547169811321) internal successors, (117), 50 states have internal predecessors, (117), 8 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2021-11-23 02:27:58,106 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|)))))))))) (_ bv1 1))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) is different from false [2021-11-23 02:28:00,153 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (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|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (store (select |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32))) |c_#memory_$Pointer$.base|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (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 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (_ bv1 1)) (_ bv0 1)))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) is different from false [2021-11-23 02:28:02,185 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))))) (bvult (_ bv0 32) |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from false [2021-11-23 02:28:04,220 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))))) (bvult (_ bv0 32) |c_#StackHeapBarrier|) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from false [2021-11-23 02:28:14,186 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (bvult (_ bv0 32) |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_140| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_140|))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_140| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_140| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_140|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|)))))))))) (_ bv1 1))) (not (bvult |v_node_create_~temp~0#1.base_140| |c_#StackHeapBarrier|)) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) is different from false [2021-11-23 02:28:16,446 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_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.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|)))))))))) (_ bv1 1))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) is different from false [2021-11-23 02:28:18,487 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (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|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (_ bv1 1) (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|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (store (select |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32))) |c_#memory_$Pointer$.base|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (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 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (_ bv1 1)) (_ bv0 1)))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) is different from false [2021-11-23 02:28:20,539 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))))) (bvult (_ bv0 32) |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|)))))) (_ bv1 1))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|)))))) is different from false [2021-11-23 02:28:22,581 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))))) (bvult (_ bv0 32) |c_#StackHeapBarrier|) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|)))))) (_ bv1 1))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|)))))) is different from false [2021-11-23 02:28:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:28:24,718 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2021-11-23 02:28:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-23 02:28:24,718 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 53 states have (on average 2.207547169811321) internal successors, (117), 50 states have internal predecessors, (117), 8 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) Word has length 40 [2021-11-23 02:28:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:28:24,720 INFO L225 Difference]: With dead ends: 162 [2021-11-23 02:28:24,720 INFO L226 Difference]: Without dead ends: 162 [2021-11-23 02:28:24,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 168 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 149.7s TimeCoverageRelationStatistics Valid=383, Invalid=2509, Unknown=46, NotChecked=2318, Total=5256 [2021-11-23 02:28:24,722 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 78 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1371 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:28:24,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 1859 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 391 Invalid, 0 Unknown, 1371 Unchecked, 2.7s Time] [2021-11-23 02:28:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-23 02:28:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2021-11-23 02:28:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 92 states have (on average 1.5543478260869565) internal successors, (143), 131 states have internal predecessors, (143), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:28:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2021-11-23 02:28:24,731 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 40 [2021-11-23 02:28:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:28:24,731 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2021-11-23 02:28:24,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 53 states have (on average 2.207547169811321) internal successors, (117), 50 states have internal predecessors, (117), 8 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2021-11-23 02:28:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2021-11-23 02:28:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 02:28:24,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:28:24,736 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:28:24,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-23 02:28:24,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-23 02:28:25,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2021-11-23 02:28:25,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:28:25,340 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:28:25,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:28:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash 931477671, now seen corresponding path program 1 times [2021-11-23 02:28:25,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:28:25,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256381770] [2021-11-23 02:28:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:28:25,342 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:28:25,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:28:25,344 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:28:25,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-23 02:28:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:28:25,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-23 02:28:25,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:28:26,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:28:26,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:28:28,049 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 34 treesize of output 26 [2021-11-23 02:28:28,069 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 11 treesize of output 7 [2021-11-23 02:28:32,090 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:28:32,090 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 100 treesize of output 88 [2021-11-23 02:28:32,353 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:28:32,354 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 85 treesize of output 69 [2021-11-23 02:28:32,419 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-23 02:28:32,420 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 70 treesize of output 70 [2021-11-23 02:28:32,531 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-23 02:28:32,531 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 60 treesize of output 62 [2021-11-23 02:28:33,471 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:28:33,471 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 64 treesize of output 48 [2021-11-23 02:28:33,490 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:28:33,491 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 42 treesize of output 30 [2021-11-23 02:28:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:28:34,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:28:43,561 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_160| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse0 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_160| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse0 v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) (bvult |v_node_create_~temp~0#1.base_160| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_160|)))))))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (let ((.cse3 (bvadd .cse2 (_ bv4 32)))) (and (bvule .cse2 .cse3) (bvule .cse3 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)))))))) is different from false [2021-11-23 02:28:45,578 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_160| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse0 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_160| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse0 v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) (bvult |v_node_create_~temp~0#1.base_160| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_160|)))))))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (let ((.cse3 (bvadd .cse2 (_ bv4 32)))) (and (bvule .cse2 .cse3) (bvule .cse3 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)))))))) is different from true [2021-11-23 02:28:54,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_160| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_160| |c_#StackHeapBarrier|) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) v_prenex_1 (_ bv0 32)) (bvadd (_ bv4 32) v_prenex_1) v_prenex_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse1 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_160| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse1 v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_160|)))))))) (and (forall ((v_DerPreprocessor_10 (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse3 (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse3 v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (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|) .cse3 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)))))))) is different from false [2021-11-23 02:28:59,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_160| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_160| |c_#StackHeapBarrier|) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) v_prenex_1 (_ bv0 32)) (bvadd (_ bv4 32) v_prenex_1) v_prenex_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse1 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_160| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse1 v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_160|)))))))) (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse2 v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse2 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2021-11-23 02:29:09,186 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_161| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_161| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_161|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_161| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_161|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse1 v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_161| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_161| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_161|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse1 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((|v_node_create_~temp~0#1.base_160| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_160| |c_#StackHeapBarrier|) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) v_prenex_1 (_ bv0 32)) (bvadd (_ bv4 32) v_prenex_1) v_prenex_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse3 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_160| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse3 v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_160|)))))))) (not (bvult |v_node_create_~temp~0#1.base_161| |c_#StackHeapBarrier|)) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_161|))))) is different from true [2021-11-23 02:29:09,212 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 243 treesize of output 235 [2021-11-23 02:29:09,227 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 688 treesize of output 652 [2021-11-23 02:29:19,302 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 19 treesize of output 17 [2021-11-23 02:29:21,721 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 27 treesize of output 25 [2021-11-23 02:29:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-23 02:29:21,850 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:21,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256381770] [2021-11-23 02:29:21,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256381770] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:29:21,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1587337826] [2021-11-23 02:29:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:21,850 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:29:21,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:29:21,857 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:29:21,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ac163b-33ea-4681-b15b-55ab91b4fe12/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2021-11-23 02:29:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:22,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-23 02:29:22,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:23,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:29:23,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:29:26,401 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 33 treesize of output 25 [2021-11-23 02:29:26,419 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 11 treesize of output 7 [2021-11-23 02:29:27,939 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:29:27,939 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 98 treesize of output 82 [2021-11-23 02:29:28,158 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:29:28,158 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 83 treesize of output 71 [2021-11-23 02:29:28,218 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-23 02:29:28,218 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 68 treesize of output 68 [2021-11-23 02:29:28,306 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-23 02:29:28,307 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 57 treesize of output 59 [2021-11-23 02:29:29,320 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:29:29,321 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 64 treesize of output 48 [2021-11-23 02:29:29,337 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:29:29,337 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 42 treesize of output 30 [2021-11-23 02:29:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:29:29,784 INFO L328 TraceCheckSpWp]: Computing backward predicates...