./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 04:43:46,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 04:43:46,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 04:43:46,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 04:43:46,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 04:43:46,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 04:43:46,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 04:43:46,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 04:43:46,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 04:43:46,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 04:43:46,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 04:43:46,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 04:43:46,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 04:43:46,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 04:43:46,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 04:43:46,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 04:43:46,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 04:43:46,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 04:43:46,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 04:43:46,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 04:43:46,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 04:43:46,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 04:43:46,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 04:43:46,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 04:43:46,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 04:43:46,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 04:43:46,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 04:43:46,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 04:43:46,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 04:43:46,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 04:43:46,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 04:43:46,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 04:43:46,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 04:43:46,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 04:43:46,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 04:43:46,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 04:43:46,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 04:43:46,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 04:43:46,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 04:43:46,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 04:43:46,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 04:43:46,670 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-11-19 04:43:46,723 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 04:43:46,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 04:43:46,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-19 04:43:46,725 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-19 04:43:46,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 04:43:46,727 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 04:43:46,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-19 04:43:46,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-19 04:43:46,730 INFO L138 SettingsManager]: * Use SBE=true [2021-11-19 04:43:46,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 04:43:46,732 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 04:43:46,732 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 04:43:46,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 04:43:46,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 04:43:46,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 04:43:46,734 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-19 04:43:46,734 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-19 04:43:46,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 04:43:46,734 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 04:43:46,735 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 04:43:46,735 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 04:43:46,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 04:43:46,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 04:43:46,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 04:43:46,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 04:43:46,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 04:43:46,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 04:43:46,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-19 04:43:46,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 04:43:46,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 04:43:46,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/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_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2021-11-19 04:43:47,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 04:43:47,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 04:43:47,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 04:43:47,103 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 04:43:47,104 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 04:43:47,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-11-19 04:43:47,197 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/data/f0957dba0/b0d637977ec446fd855c058980159f85/FLAG91512460c [2021-11-19 04:43:47,826 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 04:43:47,827 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-11-19 04:43:47,857 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/data/f0957dba0/b0d637977ec446fd855c058980159f85/FLAG91512460c [2021-11-19 04:43:48,103 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/data/f0957dba0/b0d637977ec446fd855c058980159f85 [2021-11-19 04:43:48,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 04:43:48,107 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-19 04:43:48,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 04:43:48,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 04:43:48,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 04:43:48,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:43:48" (1/1) ... [2021-11-19 04:43:48,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e78953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48, skipping insertion in model container [2021-11-19 04:43:48,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:43:48" (1/1) ... [2021-11-19 04:43:48,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 04:43:48,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 04:43:48,583 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_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-11-19 04:43:48,620 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 04:43:48,630 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 04:43:48,669 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_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-11-19 04:43:48,702 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 04:43:48,755 INFO L208 MainTranslator]: Completed translation [2021-11-19 04:43:48,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48 WrapperNode [2021-11-19 04:43:48,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 04:43:48,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 04:43:48,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 04:43:48,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 04:43:48,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48" (1/1) ... [2021-11-19 04:43:48,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48" (1/1) ... [2021-11-19 04:43:48,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48" (1/1) ... [2021-11-19 04:43:48,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48" (1/1) ... [2021-11-19 04:43:48,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48" (1/1) ... [2021-11-19 04:43:48,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48" (1/1) ... [2021-11-19 04:43:48,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48" (1/1) ... [2021-11-19 04:43:48,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 04:43:48,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 04:43:48,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 04:43:48,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 04:43:48,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48" (1/1) ... [2021-11-19 04:43:48,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 04:43:48,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:43:48,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 04:43:48,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 04:43:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-19 04:43:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 04:43:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-19 04:43:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-11-19 04:43:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-11-19 04:43:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-11-19 04:43:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_node [2021-11-19 04:43:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2021-11-19 04:43:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sll [2021-11-19 04:43:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure init_back_link [2021-11-19 04:43:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure reverse_dll [2021-11-19 04:43:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_fw_link [2021-11-19 04:43:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2021-11-19 04:43:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2021-11-19 04:43:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-19 04:43:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-19 04:43:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-19 04:43:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-11-19 04:43:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-11-19 04:43:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-19 04:43:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 04:43:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-11-19 04:43:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-11-19 04:43:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-11-19 04:43:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-11-19 04:43:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-11-19 04:43:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-11-19 04:43:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-11-19 04:43:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-11-19 04:43:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-11-19 04:43:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-11-19 04:43:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-11-19 04:43:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-11-19 04:43:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-11-19 04:43:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-11-19 04:43:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-11-19 04:43:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-11-19 04:43:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-11-19 04:43:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-11-19 04:43:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-11-19 04:43:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-11-19 04:43:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-11-19 04:43:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-11-19 04:43:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-11-19 04:43:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-11-19 04:43:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-11-19 04:43:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-11-19 04:43:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-11-19 04:43:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-11-19 04:43:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-11-19 04:43:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-11-19 04:43:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-11-19 04:43:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-11-19 04:43:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-11-19 04:43:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-11-19 04:43:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-11-19 04:43:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-11-19 04:43:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-11-19 04:43:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-11-19 04:43:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-11-19 04:43:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-11-19 04:43:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-11-19 04:43:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-11-19 04:43:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-11-19 04:43:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-11-19 04:43:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-11-19 04:43:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-11-19 04:43:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-11-19 04:43:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-11-19 04:43:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-11-19 04:43:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-11-19 04:43:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-11-19 04:43:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-11-19 04:43:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-11-19 04:43:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-11-19 04:43:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-11-19 04:43:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-11-19 04:43:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-11-19 04:43:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-11-19 04:43:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-11-19 04:43:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-11-19 04:43:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-11-19 04:43:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-11-19 04:43:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-11-19 04:43:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-11-19 04:43:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-11-19 04:43:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-11-19 04:43:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-11-19 04:43:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-11-19 04:43:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-11-19 04:43:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-11-19 04:43:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-11-19 04:43:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-11-19 04:43:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-11-19 04:43:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-11-19 04:43:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-11-19 04:43:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-11-19 04:43:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-11-19 04:43:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-11-19 04:43:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-11-19 04:43:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-11-19 04:43:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-11-19 04:43:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-11-19 04:43:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-11-19 04:43:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-11-19 04:43:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-11-19 04:43:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-11-19 04:43:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-11-19 04:43:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-11-19 04:43:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-11-19 04:43:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-11-19 04:43:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-11-19 04:43:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-11-19 04:43:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-11-19 04:43:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-11-19 04:43:49,047 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-11-19 04:43:49,047 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-11-19 04:43:49,047 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-11-19 04:43:49,047 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-11-19 04:43:49,047 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-11-19 04:43:49,048 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-11-19 04:43:49,048 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-11-19 04:43:49,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-19 04:43:49,048 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-11-19 04:43:49,048 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_node [2021-11-19 04:43:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-19 04:43:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-19 04:43:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2021-11-19 04:43:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-19 04:43:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure create_sll [2021-11-19 04:43:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 04:43:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-19 04:43:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 04:43:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure init_back_link [2021-11-19 04:43:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure reverse_dll [2021-11-19 04:43:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure remove_fw_link [2021-11-19 04:43:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2021-11-19 04:43:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2021-11-19 04:43:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-19 04:43:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-19 04:43:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 04:43:49,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 04:43:49,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-19 04:43:49,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-19 04:43:49,406 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 04:43:49,408 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 04:43:50,099 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 04:43:50,114 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 04:43:50,114 INFO L301 CfgBuilder]: Removed 33 assume(true) statements. [2021-11-19 04:43:50,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:43:50 BoogieIcfgContainer [2021-11-19 04:43:50,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 04:43:50,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 04:43:50,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 04:43:50,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 04:43:50,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:43:48" (1/3) ... [2021-11-19 04:43:50,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126f7582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:43:50, skipping insertion in model container [2021-11-19 04:43:50,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:48" (2/3) ... [2021-11-19 04:43:50,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126f7582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:43:50, skipping insertion in model container [2021-11-19 04:43:50,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:43:50" (3/3) ... [2021-11-19 04:43:50,129 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2021-11-19 04:43:50,136 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 04:43:50,137 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2021-11-19 04:43:50,221 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 04:43:50,229 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-19 04:43:50,229 INFO L340 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2021-11-19 04:43:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 127 states have (on average 2.047244094488189) internal successors, (260), 220 states have internal predecessors, (260), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-11-19 04:43:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-19 04:43:50,296 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:43:50,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:43:50,297 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting create_sllErr0REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:43:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:43:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash 576320188, now seen corresponding path program 1 times [2021-11-19 04:43:50,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:43:50,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130057665] [2021-11-19 04:43:50,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:43:50,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:43:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:50,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:43:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:50,594 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-19 04:43:50,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:43:50,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130057665] [2021-11-19 04:43:50,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130057665] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:43:50,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:43:50,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 04:43:50,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921027165] [2021-11-19 04:43:50,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:43:50,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 04:43:50,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:43:50,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 04:43:50,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 04:43:50,642 INFO L87 Difference]: Start difference. First operand has 244 states, 127 states have (on average 2.047244094488189) internal successors, (260), 220 states have internal predecessors, (260), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 04:43:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:43:50,795 INFO L93 Difference]: Finished difference Result 242 states and 263 transitions. [2021-11-19 04:43:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 04:43:50,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-19 04:43:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:43:50,810 INFO L225 Difference]: With dead ends: 242 [2021-11-19 04:43:50,810 INFO L226 Difference]: Without dead ends: 239 [2021-11-19 04:43:50,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-19 04:43:50,816 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 220 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:43:50,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 252 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 04:43:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-19 04:43:50,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-19 04:43:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 123 states have (on average 1.7967479674796747) internal successors, (221), 213 states have internal predecessors, (221), 24 states have call successors, (24), 11 states have call predecessors, (24), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-19 04:43:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 260 transitions. [2021-11-19 04:43:50,912 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 260 transitions. Word has length 10 [2021-11-19 04:43:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:43:50,913 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 260 transitions. [2021-11-19 04:43:50,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 04:43:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 260 transitions. [2021-11-19 04:43:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-19 04:43:50,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:43:50,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:43:50,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 04:43:50,920 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_nodeErr0REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:43:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:43:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash -891387824, now seen corresponding path program 1 times [2021-11-19 04:43:50,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:43:50,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984120808] [2021-11-19 04:43:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:43:50,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:43:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:51,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:43:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:51,042 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-19 04:43:51,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:43:51,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984120808] [2021-11-19 04:43:51,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984120808] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:43:51,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:43:51,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 04:43:51,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796630167] [2021-11-19 04:43:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:43:51,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:43:51,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:43:51,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:43:51,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:43:51,047 INFO L87 Difference]: Start difference. First operand 239 states and 260 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 04:43:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:43:51,672 INFO L93 Difference]: Finished difference Result 237 states and 258 transitions. [2021-11-19 04:43:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 04:43:51,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-19 04:43:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:43:51,676 INFO L225 Difference]: With dead ends: 237 [2021-11-19 04:43:51,676 INFO L226 Difference]: Without dead ends: 237 [2021-11-19 04:43:51,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:43:51,678 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 223 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 04:43:51,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 266 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-19 04:43:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-11-19 04:43:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2021-11-19 04:43:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 123 states have (on average 1.7804878048780488) internal successors, (219), 211 states have internal predecessors, (219), 24 states have call successors, (24), 11 states have call predecessors, (24), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-19 04:43:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 258 transitions. [2021-11-19 04:43:51,702 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 258 transitions. Word has length 14 [2021-11-19 04:43:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:43:51,703 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 258 transitions. [2021-11-19 04:43:51,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 04:43:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 258 transitions. [2021-11-19 04:43:51,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-19 04:43:51,704 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:43:51,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:43:51,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 04:43:51,705 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_nodeErr1REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:43:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:43:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -891387823, now seen corresponding path program 1 times [2021-11-19 04:43:51,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:43:51,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495958067] [2021-11-19 04:43:51,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:43:51,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:43:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:43:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:51,798 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-19 04:43:51,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:43:51,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495958067] [2021-11-19 04:43:51,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495958067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:43:51,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:43:51,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 04:43:51,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022470955] [2021-11-19 04:43:51,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:43:51,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 04:43:51,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:43:51,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 04:43:51,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 04:43:51,803 INFO L87 Difference]: Start difference. First operand 237 states and 258 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 04:43:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:43:52,265 INFO L93 Difference]: Finished difference Result 235 states and 256 transitions. [2021-11-19 04:43:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 04:43:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-19 04:43:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:43:52,268 INFO L225 Difference]: With dead ends: 235 [2021-11-19 04:43:52,268 INFO L226 Difference]: Without dead ends: 235 [2021-11-19 04:43:52,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-19 04:43:52,273 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 219 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 04:43:52,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 266 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-19 04:43:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-19 04:43:52,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-11-19 04:43:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 123 states have (on average 1.7642276422764227) internal successors, (217), 209 states have internal predecessors, (217), 24 states have call successors, (24), 11 states have call predecessors, (24), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-19 04:43:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2021-11-19 04:43:52,306 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 14 [2021-11-19 04:43:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:43:52,306 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2021-11-19 04:43:52,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 04:43:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2021-11-19 04:43:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-19 04:43:52,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:43:52,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:43:52,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 04:43:52,309 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr0REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:43:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:43:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1703543133, now seen corresponding path program 1 times [2021-11-19 04:43:52,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:43:52,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85034016] [2021-11-19 04:43:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:43:52,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:43:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:43:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-19 04:43:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:52,593 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-19 04:43:52,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:43:52,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85034016] [2021-11-19 04:43:52,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85034016] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:43:52,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:43:52,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-19 04:43:52,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998621672] [2021-11-19 04:43:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:43:52,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 04:43:52,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:43:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 04:43:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-19 04:43:52,598 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 04:43:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:43:53,954 INFO L93 Difference]: Finished difference Result 265 states and 290 transitions. [2021-11-19 04:43:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-19 04:43:53,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-11-19 04:43:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:43:53,959 INFO L225 Difference]: With dead ends: 265 [2021-11-19 04:43:53,959 INFO L226 Difference]: Without dead ends: 265 [2021-11-19 04:43:53,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-11-19 04:43:53,965 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 415 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:43:53,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 219 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-19 04:43:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-19 04:43:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 230. [2021-11-19 04:43:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 123 states have (on average 1.7235772357723578) internal successors, (212), 204 states have internal predecessors, (212), 24 states have call successors, (24), 11 states have call predecessors, (24), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-19 04:43:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 251 transitions. [2021-11-19 04:43:54,001 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 251 transitions. Word has length 20 [2021-11-19 04:43:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:43:54,002 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 251 transitions. [2021-11-19 04:43:54,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 04:43:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 251 transitions. [2021-11-19 04:43:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-19 04:43:54,003 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:43:54,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:43:54,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-19 04:43:54,004 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr1REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:43:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:43:54,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1703543134, now seen corresponding path program 1 times [2021-11-19 04:43:54,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:43:54,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300017448] [2021-11-19 04:43:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:43:54,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:43:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:54,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:43:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:54,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-19 04:43:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:54,215 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-19 04:43:54,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:43:54,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300017448] [2021-11-19 04:43:54,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300017448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:43:54,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:43:54,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-19 04:43:54,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017915955] [2021-11-19 04:43:54,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:43:54,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 04:43:54,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:43:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 04:43:54,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-19 04:43:54,218 INFO L87 Difference]: Start difference. First operand 230 states and 251 transitions. Second operand has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 04:43:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:43:55,776 INFO L93 Difference]: Finished difference Result 276 states and 301 transitions. [2021-11-19 04:43:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-19 04:43:55,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-11-19 04:43:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:43:55,780 INFO L225 Difference]: With dead ends: 276 [2021-11-19 04:43:55,780 INFO L226 Difference]: Without dead ends: 276 [2021-11-19 04:43:55,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-11-19 04:43:55,782 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 478 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-19 04:43:55,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 249 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-19 04:43:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-19 04:43:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 240. [2021-11-19 04:43:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 130 states have (on average 1.7) internal successors, (221), 212 states have internal predecessors, (221), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:43:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 264 transitions. [2021-11-19 04:43:55,799 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 264 transitions. Word has length 20 [2021-11-19 04:43:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:43:55,799 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 264 transitions. [2021-11-19 04:43:55,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 04:43:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 264 transitions. [2021-11-19 04:43:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-19 04:43:55,801 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:43:55,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:43:55,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-19 04:43:55,801 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr2REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:43:55,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:43:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1270229956, now seen corresponding path program 1 times [2021-11-19 04:43:55,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:43:55,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112819227] [2021-11-19 04:43:55,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:43:55,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:43:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:55,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:43:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:55,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-19 04:43:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:55,912 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-19 04:43:55,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:43:55,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112819227] [2021-11-19 04:43:55,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112819227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:43:55,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:43:55,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-19 04:43:55,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371221993] [2021-11-19 04:43:55,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:43:55,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 04:43:55,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:43:55,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 04:43:55,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-19 04:43:55,915 INFO L87 Difference]: Start difference. First operand 240 states and 264 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:43:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:43:56,943 INFO L93 Difference]: Finished difference Result 273 states and 299 transitions. [2021-11-19 04:43:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 04:43:56,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-11-19 04:43:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:43:56,949 INFO L225 Difference]: With dead ends: 273 [2021-11-19 04:43:56,950 INFO L226 Difference]: Without dead ends: 273 [2021-11-19 04:43:56,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-19 04:43:56,958 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 325 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-19 04:43:56,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 259 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-19 04:43:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-19 04:43:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 239. [2021-11-19 04:43:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 130 states have (on average 1.6846153846153846) internal successors, (219), 211 states have internal predecessors, (219), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:43:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 262 transitions. [2021-11-19 04:43:56,987 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 262 transitions. Word has length 21 [2021-11-19 04:43:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:43:56,988 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 262 transitions. [2021-11-19 04:43:56,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:43:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 262 transitions. [2021-11-19 04:43:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-19 04:43:56,990 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:43:56,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:43:56,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-19 04:43:56,991 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr3REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:43:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:43:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1270229957, now seen corresponding path program 1 times [2021-11-19 04:43:56,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:43:56,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140358882] [2021-11-19 04:43:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:43:56,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:43:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:57,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:43:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-19 04:43:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:57,166 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-19 04:43:57,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:43:57,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140358882] [2021-11-19 04:43:57,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140358882] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:43:57,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:43:57,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-19 04:43:57,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914166424] [2021-11-19 04:43:57,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:43:57,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 04:43:57,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:43:57,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 04:43:57,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-19 04:43:57,170 INFO L87 Difference]: Start difference. First operand 239 states and 262 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:43:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:43:58,214 INFO L93 Difference]: Finished difference Result 272 states and 297 transitions. [2021-11-19 04:43:58,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 04:43:58,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-11-19 04:43:58,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:43:58,217 INFO L225 Difference]: With dead ends: 272 [2021-11-19 04:43:58,217 INFO L226 Difference]: Without dead ends: 272 [2021-11-19 04:43:58,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-19 04:43:58,219 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 322 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-19 04:43:58,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 257 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-19 04:43:58,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-19 04:43:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 238. [2021-11-19 04:43:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 130 states have (on average 1.6692307692307693) internal successors, (217), 210 states have internal predecessors, (217), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:43:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 260 transitions. [2021-11-19 04:43:58,237 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 260 transitions. Word has length 21 [2021-11-19 04:43:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:43:58,238 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 260 transitions. [2021-11-19 04:43:58,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 04:43:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 260 transitions. [2021-11-19 04:43:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-19 04:43:58,240 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:43:58,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:43:58,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-19 04:43:58,240 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_sllErr1REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:43:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:43:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1907624827, now seen corresponding path program 1 times [2021-11-19 04:43:58,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:43:58,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124782968] [2021-11-19 04:43:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:43:58,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:43:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:58,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:43:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:58,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-19 04:43:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:58,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:43:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:58,384 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-19 04:43:58,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:43:58,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124782968] [2021-11-19 04:43:58,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124782968] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:43:58,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:43:58,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-19 04:43:58,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263152205] [2021-11-19 04:43:58,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:43:58,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 04:43:58,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:43:58,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 04:43:58,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-19 04:43:58,394 INFO L87 Difference]: Start difference. First operand 238 states and 260 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:43:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:43:59,358 INFO L93 Difference]: Finished difference Result 269 states and 294 transitions. [2021-11-19 04:43:59,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-19 04:43:59,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2021-11-19 04:43:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:43:59,362 INFO L225 Difference]: With dead ends: 269 [2021-11-19 04:43:59,362 INFO L226 Difference]: Without dead ends: 269 [2021-11-19 04:43:59,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-19 04:43:59,363 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 343 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-19 04:43:59,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 257 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-19 04:43:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-19 04:43:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 235. [2021-11-19 04:43:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 130 states have (on average 1.646153846153846) internal successors, (214), 207 states have internal predecessors, (214), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:43:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 257 transitions. [2021-11-19 04:43:59,381 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 257 transitions. Word has length 28 [2021-11-19 04:43:59,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:43:59,382 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 257 transitions. [2021-11-19 04:43:59,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:43:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 257 transitions. [2021-11-19 04:43:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-19 04:43:59,384 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:43:59,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:43:59,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-19 04:43:59,385 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_sllErr2REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:43:59,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:43:59,385 INFO L85 PathProgramCache]: Analyzing trace with hash -993172203, now seen corresponding path program 1 times [2021-11-19 04:43:59,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:43:59,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181180434] [2021-11-19 04:43:59,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:43:59,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:43:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:59,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:43:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-19 04:43:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:59,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:43:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:43:59,766 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-19 04:43:59,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:43:59,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181180434] [2021-11-19 04:43:59,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181180434] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:43:59,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:43:59,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-19 04:43:59,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968161617] [2021-11-19 04:43:59,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:43:59,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-19 04:43:59,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:43:59,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-19 04:43:59,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-19 04:43:59,771 INFO L87 Difference]: Start difference. First operand 235 states and 257 transitions. Second operand has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:44:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:44:01,167 INFO L93 Difference]: Finished difference Result 274 states and 300 transitions. [2021-11-19 04:44:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-19 04:44:01,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2021-11-19 04:44:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:44:01,170 INFO L225 Difference]: With dead ends: 274 [2021-11-19 04:44:01,170 INFO L226 Difference]: Without dead ends: 274 [2021-11-19 04:44:01,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-11-19 04:44:01,171 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 512 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-19 04:44:01,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 147 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-19 04:44:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-11-19 04:44:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 228. [2021-11-19 04:44:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 130 states have (on average 1.5923076923076922) internal successors, (207), 200 states have internal predecessors, (207), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:44:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 250 transitions. [2021-11-19 04:44:01,182 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 250 transitions. Word has length 29 [2021-11-19 04:44:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:44:01,182 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 250 transitions. [2021-11-19 04:44:01,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:44:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 250 transitions. [2021-11-19 04:44:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-19 04:44:01,184 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:44:01,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:44:01,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-19 04:44:01,185 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_sllErr3REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:44:01,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:44:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash -993172202, now seen corresponding path program 1 times [2021-11-19 04:44:01,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:44:01,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942745757] [2021-11-19 04:44:01,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:01,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:44:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:44:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:01,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-19 04:44:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:01,553 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-19 04:44:01,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:44:01,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942745757] [2021-11-19 04:44:01,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942745757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:44:01,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:44:01,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-19 04:44:01,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884665915] [2021-11-19 04:44:01,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:44:01,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-19 04:44:01,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:44:01,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-19 04:44:01,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-19 04:44:01,558 INFO L87 Difference]: Start difference. First operand 228 states and 250 transitions. Second operand has 12 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:44:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:44:03,061 INFO L93 Difference]: Finished difference Result 261 states and 286 transitions. [2021-11-19 04:44:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-19 04:44:03,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2021-11-19 04:44:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:44:03,064 INFO L225 Difference]: With dead ends: 261 [2021-11-19 04:44:03,064 INFO L226 Difference]: Without dead ends: 261 [2021-11-19 04:44:03,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-11-19 04:44:03,065 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 578 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-19 04:44:03,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 223 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-19 04:44:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-19 04:44:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 227. [2021-11-19 04:44:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 130 states have (on average 1.5846153846153845) internal successors, (206), 199 states have internal predecessors, (206), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:44:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 249 transitions. [2021-11-19 04:44:03,077 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 249 transitions. Word has length 29 [2021-11-19 04:44:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:44:03,078 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 249 transitions. [2021-11-19 04:44:03,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:44:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 249 transitions. [2021-11-19 04:44:03,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-19 04:44:03,084 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:44:03,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:44:03,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-19 04:44:03,085 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_sllErr6REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:44:03,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:44:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1009012061, now seen corresponding path program 1 times [2021-11-19 04:44:03,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:44:03,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207880493] [2021-11-19 04:44:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:03,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:44:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:03,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:44:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:03,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-19 04:44:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:03,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:03,465 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-19 04:44:03,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:44:03,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207880493] [2021-11-19 04:44:03,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207880493] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:44:03,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:44:03,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-19 04:44:03,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849082504] [2021-11-19 04:44:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:44:03,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-19 04:44:03,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:44:03,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-19 04:44:03,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-19 04:44:03,468 INFO L87 Difference]: Start difference. First operand 227 states and 249 transitions. Second operand has 14 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:44:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:44:04,836 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2021-11-19 04:44:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-19 04:44:04,837 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2021-11-19 04:44:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:44:04,839 INFO L225 Difference]: With dead ends: 260 [2021-11-19 04:44:04,839 INFO L226 Difference]: Without dead ends: 260 [2021-11-19 04:44:04,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2021-11-19 04:44:04,841 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 612 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:44:04,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [624 Valid, 236 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-19 04:44:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-19 04:44:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 226. [2021-11-19 04:44:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 198 states have internal predecessors, (205), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:44:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2021-11-19 04:44:04,850 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 34 [2021-11-19 04:44:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:44:04,850 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2021-11-19 04:44:04,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:44:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2021-11-19 04:44:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-19 04:44:04,852 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:44:04,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:44:04,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-19 04:44:04,852 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_sllErr7REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:44:04,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:44:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1009012060, now seen corresponding path program 1 times [2021-11-19 04:44:04,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:44:04,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389215991] [2021-11-19 04:44:04,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:04,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:44:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:04,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:44:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-19 04:44:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:05,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:05,099 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-19 04:44:05,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:44:05,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389215991] [2021-11-19 04:44:05,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389215991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:44:05,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:44:05,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-19 04:44:05,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295366723] [2021-11-19 04:44:05,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:44:05,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-19 04:44:05,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:44:05,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-19 04:44:05,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-19 04:44:05,103 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand has 12 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:44:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:44:06,213 INFO L93 Difference]: Finished difference Result 252 states and 277 transitions. [2021-11-19 04:44:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-19 04:44:06,214 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2021-11-19 04:44:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:44:06,217 INFO L225 Difference]: With dead ends: 252 [2021-11-19 04:44:06,217 INFO L226 Difference]: Without dead ends: 252 [2021-11-19 04:44:06,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2021-11-19 04:44:06,218 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 499 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:44:06,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 131 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-19 04:44:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-11-19 04:44:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 218. [2021-11-19 04:44:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 130 states have (on average 1.5153846153846153) internal successors, (197), 190 states have internal predecessors, (197), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:44:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 240 transitions. [2021-11-19 04:44:06,230 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 240 transitions. Word has length 34 [2021-11-19 04:44:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:44:06,231 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 240 transitions. [2021-11-19 04:44:06,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 04:44:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 240 transitions. [2021-11-19 04:44:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-19 04:44:06,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:44:06,236 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:44:06,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-19 04:44:06,236 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting chain_nodeErr1REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:44:06,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:44:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2119025272, now seen corresponding path program 1 times [2021-11-19 04:44:06,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:44:06,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305264294] [2021-11-19 04:44:06,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:06,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:44:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:06,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:44:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-19 04:44:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:06,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-19 04:44:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 04:44:06,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:44:06,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305264294] [2021-11-19 04:44:06,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305264294] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:44:06,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425688388] [2021-11-19 04:44:06,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:06,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:44:06,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:44:06,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:44:06,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 04:44:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:06,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-19 04:44:06,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:44:07,241 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-19 04:44:07,469 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-19 04:44:07,469 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 17 treesize of output 19 [2021-11-19 04:44:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:44:07,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:44:09,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425688388] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:44:09,753 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-19 04:44:09,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2021-11-19 04:44:09,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139357037] [2021-11-19 04:44:09,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-19 04:44:09,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-19 04:44:09,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:44:09,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-19 04:44:09,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=480, Unknown=1, NotChecked=0, Total=552 [2021-11-19 04:44:09,755 INFO L87 Difference]: Start difference. First operand 218 states and 240 transitions. Second operand has 22 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-19 04:44:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:44:11,892 INFO L93 Difference]: Finished difference Result 251 states and 276 transitions. [2021-11-19 04:44:11,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-19 04:44:11,892 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2021-11-19 04:44:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:44:11,894 INFO L225 Difference]: With dead ends: 251 [2021-11-19 04:44:11,895 INFO L226 Difference]: Without dead ends: 251 [2021-11-19 04:44:11,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=165, Invalid=1024, Unknown=1, NotChecked=0, Total=1190 [2021-11-19 04:44:11,896 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 460 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-19 04:44:11,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 350 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2383 Invalid, 0 Unknown, 229 Unchecked, 1.6s Time] [2021-11-19 04:44:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-11-19 04:44:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2021-11-19 04:44:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 189 states have internal predecessors, (196), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:44:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 239 transitions. [2021-11-19 04:44:11,912 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 239 transitions. Word has length 39 [2021-11-19 04:44:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:44:11,912 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 239 transitions. [2021-11-19 04:44:11,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-19 04:44:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 239 transitions. [2021-11-19 04:44:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-19 04:44:11,918 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:44:11,918 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:44:11,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 04:44:12,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:44:12,142 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting chain_nodeErr5REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:44:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:44:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash 452914156, now seen corresponding path program 1 times [2021-11-19 04:44:12,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:44:12,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625718411] [2021-11-19 04:44:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:12,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:44:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:12,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:44:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:12,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-19 04:44:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:12,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-19 04:44:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-19 04:44:12,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:44:12,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625718411] [2021-11-19 04:44:12,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625718411] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:44:12,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186916623] [2021-11-19 04:44:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:12,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:44:12,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:44:12,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:44:12,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-19 04:44:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:12,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-19 04:44:12,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:44:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-19 04:44:12,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-19 04:44:12,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186916623] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:44:12,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:44:12,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-11-19 04:44:12,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254004197] [2021-11-19 04:44:12,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:44:12,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 04:44:12,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:44:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 04:44:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-19 04:44:12,559 INFO L87 Difference]: Start difference. First operand 217 states and 239 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-19 04:44:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:44:12,699 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2021-11-19 04:44:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 04:44:12,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2021-11-19 04:44:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:44:12,701 INFO L225 Difference]: With dead ends: 216 [2021-11-19 04:44:12,701 INFO L226 Difference]: Without dead ends: 216 [2021-11-19 04:44:12,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-19 04:44:12,702 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:44:12,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 381 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 04:44:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-19 04:44:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-11-19 04:44:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 130 states have (on average 1.5) internal successors, (195), 188 states have internal predecessors, (195), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:44:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 238 transitions. [2021-11-19 04:44:12,709 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 238 transitions. Word has length 42 [2021-11-19 04:44:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:44:12,710 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 238 transitions. [2021-11-19 04:44:12,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-19 04:44:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 238 transitions. [2021-11-19 04:44:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-19 04:44:12,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:44:12,711 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:44:12,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-19 04:44:12,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:44:12,938 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:44:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:44:12,938 INFO L85 PathProgramCache]: Analyzing trace with hash -675063223, now seen corresponding path program 1 times [2021-11-19 04:44:12,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:44:12,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820775529] [2021-11-19 04:44:12,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:12,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:44:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:13,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:44:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:13,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:44:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-19 04:44:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:13,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-19 04:44:13,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:44:13,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820775529] [2021-11-19 04:44:13,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820775529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:44:13,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:44:13,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-19 04:44:13,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013826317] [2021-11-19 04:44:13,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:44:13,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 04:44:13,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:44:13,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 04:44:13,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-19 04:44:13,357 INFO L87 Difference]: Start difference. First operand 216 states and 238 transitions. Second operand has 13 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-19 04:44:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:44:15,096 INFO L93 Difference]: Finished difference Result 255 states and 281 transitions. [2021-11-19 04:44:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-19 04:44:15,097 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 61 [2021-11-19 04:44:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:44:15,100 INFO L225 Difference]: With dead ends: 255 [2021-11-19 04:44:15,100 INFO L226 Difference]: Without dead ends: 255 [2021-11-19 04:44:15,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2021-11-19 04:44:15,101 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 467 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-19 04:44:15,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 130 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-19 04:44:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-19 04:44:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 209. [2021-11-19 04:44:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 130 states have (on average 1.4461538461538461) internal successors, (188), 181 states have internal predecessors, (188), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:44:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2021-11-19 04:44:15,111 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 61 [2021-11-19 04:44:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:44:15,112 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2021-11-19 04:44:15,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-19 04:44:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2021-11-19 04:44:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-19 04:44:15,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:44:15,114 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:44:15,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-19 04:44:15,114 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr3REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:44:15,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:44:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash 547876632, now seen corresponding path program 1 times [2021-11-19 04:44:15,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:44:15,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533705544] [2021-11-19 04:44:15,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:15,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:44:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:15,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:44:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:44:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:15,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:15,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:15,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-19 04:44:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-19 04:44:15,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:44:15,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533705544] [2021-11-19 04:44:15,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533705544] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:44:15,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:44:15,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-19 04:44:15,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433132480] [2021-11-19 04:44:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:44:15,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 04:44:15,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:44:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 04:44:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-19 04:44:15,415 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand has 13 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-19 04:44:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:44:16,595 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2021-11-19 04:44:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 04:44:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 62 [2021-11-19 04:44:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:44:16,599 INFO L225 Difference]: With dead ends: 243 [2021-11-19 04:44:16,599 INFO L226 Difference]: Without dead ends: 243 [2021-11-19 04:44:16,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2021-11-19 04:44:16,601 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 553 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-19 04:44:16,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 177 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-19 04:44:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-19 04:44:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 202. [2021-11-19 04:44:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 174 states have internal predecessors, (181), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:44:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2021-11-19 04:44:16,613 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 62 [2021-11-19 04:44:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:44:16,614 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2021-11-19 04:44:16,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-19 04:44:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2021-11-19 04:44:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-19 04:44:16,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:44:16,616 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:44:16,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-19 04:44:16,617 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr2REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:44:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:44:16,618 INFO L85 PathProgramCache]: Analyzing trace with hash 547876631, now seen corresponding path program 1 times [2021-11-19 04:44:16,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:44:16,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273734444] [2021-11-19 04:44:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:16,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:44:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:44:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:44:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:16,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-19 04:44:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:16,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-19 04:44:17,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:44:17,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273734444] [2021-11-19 04:44:17,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273734444] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 04:44:17,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 04:44:17,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-19 04:44:17,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439007139] [2021-11-19 04:44:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 04:44:17,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-19 04:44:17,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:44:17,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-19 04:44:17,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-19 04:44:17,083 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 12 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-19 04:44:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:44:18,099 INFO L93 Difference]: Finished difference Result 247 states and 273 transitions. [2021-11-19 04:44:18,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-19 04:44:18,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 62 [2021-11-19 04:44:18,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:44:18,101 INFO L225 Difference]: With dead ends: 247 [2021-11-19 04:44:18,102 INFO L226 Difference]: Without dead ends: 247 [2021-11-19 04:44:18,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2021-11-19 04:44:18,103 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 419 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-19 04:44:18,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 127 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-19 04:44:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-11-19 04:44:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 201. [2021-11-19 04:44:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 173 states have internal predecessors, (180), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 04:44:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2021-11-19 04:44:18,113 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 62 [2021-11-19 04:44:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:44:18,114 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2021-11-19 04:44:18,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-19 04:44:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2021-11-19 04:44:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-19 04:44:18,116 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:44:18,116 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:44:18,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-19 04:44:18,116 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:44:18,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:44:18,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1203680122, now seen corresponding path program 1 times [2021-11-19 04:44:18,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:44:18,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040000918] [2021-11-19 04:44:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:18,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:44:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:18,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:44:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:18,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:44:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:18,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:18,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-19 04:44:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:19,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:44:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-19 04:44:19,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:44:19,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040000918] [2021-11-19 04:44:19,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040000918] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:44:19,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143265980] [2021-11-19 04:44:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:44:19,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:44:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:44:19,606 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:44:19,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-19 04:44:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:44:19,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 83 conjunts are in the unsatisfiable core [2021-11-19 04:44:19,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:44:20,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-19 04:44:20,472 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-19 04:44:20,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2021-11-19 04:44:20,795 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-19 04:44:20,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 29 [2021-11-19 04:44:45,021 INFO L354 Elim1Store]: treesize reduction 405, result has 21.4 percent of original size [2021-11-19 04:44:45,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 140 [2021-11-19 04:44:45,042 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-19 04:44:45,043 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 160 treesize of output 160 [2021-11-19 04:44:54,213 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 399 treesize of output 398 [2021-11-19 04:45:01,569 INFO L354 Elim1Store]: treesize reduction 61, result has 14.1 percent of original size [2021-11-19 04:45:01,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 61 [2021-11-19 04:45:01,581 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 04:45:01,581 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 61 treesize of output 61 [2021-11-19 04:45:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:45:01,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:45:02,448 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 04:45:02,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1270 treesize of output 1266 [2021-11-19 04:45:02,481 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 1258 treesize of output 1256 [2021-11-19 04:45:02,814 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 10 treesize of output 8 [2021-11-19 04:45:03,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143265980] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:45:03,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-19 04:45:03,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 52 [2021-11-19 04:45:03,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769322821] [2021-11-19 04:45:03,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-19 04:45:03,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-11-19 04:45:03,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:45:03,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-11-19 04:45:03,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3005, Unknown=11, NotChecked=0, Total=3192 [2021-11-19 04:45:03,256 INFO L87 Difference]: Start difference. First operand 201 states and 223 transitions. Second operand has 52 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 45 states have internal predecessors, (94), 11 states have call successors, (15), 6 states have call predecessors, (15), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2021-11-19 04:45:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:45:42,874 INFO L93 Difference]: Finished difference Result 346 states and 397 transitions. [2021-11-19 04:45:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-19 04:45:42,874 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 45 states have internal predecessors, (94), 11 states have call successors, (15), 6 states have call predecessors, (15), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 67 [2021-11-19 04:45:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:45:42,877 INFO L225 Difference]: With dead ends: 346 [2021-11-19 04:45:42,877 INFO L226 Difference]: Without dead ends: 346 [2021-11-19 04:45:42,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 64.1s TimeCoverageRelationStatistics Valid=429, Invalid=7198, Unknown=29, NotChecked=0, Total=7656 [2021-11-19 04:45:42,881 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 517 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 5345 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 6699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 5345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1201 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-19 04:45:42,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 1183 Invalid, 6699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 5345 Invalid, 0 Unknown, 1201 Unchecked, 3.4s Time] [2021-11-19 04:45:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-11-19 04:45:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 243. [2021-11-19 04:45:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 164 states have (on average 1.3597560975609757) internal successors, (223), 209 states have internal predecessors, (223), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (23), 19 states have call predecessors, (23), 22 states have call successors, (23) [2021-11-19 04:45:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 277 transitions. [2021-11-19 04:45:42,895 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 277 transitions. Word has length 67 [2021-11-19 04:45:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:45:42,895 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 277 transitions. [2021-11-19 04:45:42,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 45 states have internal predecessors, (94), 11 states have call successors, (15), 6 states have call predecessors, (15), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2021-11-19 04:45:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 277 transitions. [2021-11-19 04:45:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-19 04:45:42,897 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:45:42,897 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:45:42,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-19 04:45:43,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-19 04:45:43,114 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:45:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:45:43,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1390616004, now seen corresponding path program 1 times [2021-11-19 04:45:43,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:45:43,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121050212] [2021-11-19 04:45:43,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:45:43,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:45:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:45:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:45:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:45:43,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:45:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:45:43,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:45:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:45:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:45:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:45:43,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-19 04:45:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:45:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:45:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:45:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-19 04:45:44,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:45:44,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121050212] [2021-11-19 04:45:44,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121050212] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:45:44,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582152657] [2021-11-19 04:45:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:45:44,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:45:44,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:45:44,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:45:44,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 04:45:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:45:44,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 129 conjunts are in the unsatisfiable core [2021-11-19 04:45:44,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:45:44,698 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-19 04:45:44,698 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 19 treesize of output 18 [2021-11-19 04:45:44,808 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 04:45:44,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-11-19 04:45:45,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 04:45:45,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-19 04:45:45,609 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-11-19 04:45:45,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-11-19 04:45:45,644 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-19 04:45:45,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2021-11-19 04:45:46,010 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-19 04:45:46,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2021-11-19 04:45:46,048 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-19 04:45:46,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 29 [2021-11-19 04:46:26,811 INFO L354 Elim1Store]: treesize reduction 271, result has 21.0 percent of original size [2021-11-19 04:46:26,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 156 treesize of output 179 [2021-11-19 04:46:26,836 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 04:46:26,836 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 182 treesize of output 182 [2021-11-19 04:46:27,043 INFO L354 Elim1Store]: treesize reduction 453, result has 22.3 percent of original size [2021-11-19 04:46:27,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 176 treesize of output 241 [2021-11-19 04:46:41,699 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 482 treesize of output 481 [2021-11-19 04:47:32,096 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-19 04:47:32,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 186 treesize of output 188 [2021-11-19 04:47:34,648 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-11-19 04:47:34,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 123 [2021-11-19 04:47:34,665 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 04:47:34,665 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 120 treesize of output 116 [2021-11-19 04:47:35,164 INFO L354 Elim1Store]: treesize reduction 111, result has 8.3 percent of original size [2021-11-19 04:47:35,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 60 [2021-11-19 04:47:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:47:35,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:47:37,088 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 2224 treesize of output 2222 [2021-11-19 04:47:37,140 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-19 04:47:37,141 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 2218 treesize of output 2217 [2021-11-19 04:47:37,174 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-19 04:47:37,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:47:37,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2021-11-19 04:47:37,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081662126] [2021-11-19 04:47:37,175 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 04:47:37,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-19 04:47:37,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:47:37,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-19 04:47:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=4059, Unknown=14, NotChecked=0, Total=4290 [2021-11-19 04:47:37,178 INFO L87 Difference]: Start difference. First operand 243 states and 277 transitions. Second operand has 30 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 8 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-19 04:47:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:47:44,011 INFO L93 Difference]: Finished difference Result 345 states and 396 transitions. [2021-11-19 04:47:44,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-19 04:47:44,011 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 8 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 69 [2021-11-19 04:47:44,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:47:44,013 INFO L225 Difference]: With dead ends: 345 [2021-11-19 04:47:44,013 INFO L226 Difference]: Without dead ends: 345 [2021-11-19 04:47:44,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2113 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=442, Invalid=7916, Unknown=14, NotChecked=0, Total=8372 [2021-11-19 04:47:44,016 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 614 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 4876 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 5111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 4876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-19 04:47:44,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [614 Valid, 400 Invalid, 5111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 4876 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-11-19 04:47:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-11-19 04:47:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 243. [2021-11-19 04:47:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 164 states have (on average 1.353658536585366) internal successors, (222), 209 states have internal predecessors, (222), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (23), 19 states have call predecessors, (23), 22 states have call successors, (23) [2021-11-19 04:47:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 276 transitions. [2021-11-19 04:47:44,028 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 276 transitions. Word has length 69 [2021-11-19 04:47:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:47:44,028 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 276 transitions. [2021-11-19 04:47:44,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 8 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-19 04:47:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 276 transitions. [2021-11-19 04:47:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-19 04:47:44,030 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:47:44,030 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:47:44,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-19 04:47:44,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:47:44,254 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting check_seq_nextErr0REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:47:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:47:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1390616664, now seen corresponding path program 1 times [2021-11-19 04:47:44,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:47:44,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153051440] [2021-11-19 04:47:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:47:44,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:47:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:47:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:47:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:47:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:47:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:47:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:47:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:47:44,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:47:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:47:45,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-19 04:47:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:47:45,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:47:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:47:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-19 04:47:46,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:47:46,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153051440] [2021-11-19 04:47:46,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153051440] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:47:46,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708540801] [2021-11-19 04:47:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:47:46,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:47:46,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:47:46,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:47:46,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-19 04:47:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:47:46,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 88 conjunts are in the unsatisfiable core [2021-11-19 04:47:46,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:47:46,272 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-19 04:47:46,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-11-19 04:47:46,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 04:47:46,870 INFO L354 Elim1Store]: treesize reduction 18, result has 30.8 percent of original size [2021-11-19 04:47:46,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 24 [2021-11-19 04:47:47,031 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-11-19 04:47:47,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2021-11-19 04:47:47,384 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-19 04:47:47,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-11-19 04:48:15,323 INFO L354 Elim1Store]: treesize reduction 271, result has 21.0 percent of original size [2021-11-19 04:48:15,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 117 [2021-11-19 04:48:15,358 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-11-19 04:48:15,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 132 treesize of output 147 [2021-11-19 04:48:19,693 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-11-19 04:48:19,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 183 treesize of output 186 [2021-11-19 04:48:29,671 INFO L354 Elim1Store]: treesize reduction 61, result has 14.1 percent of original size [2021-11-19 04:48:29,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 75 [2021-11-19 04:48:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:48:30,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:48:31,557 INFO L354 Elim1Store]: treesize reduction 52, result has 69.2 percent of original size [2021-11-19 04:48:31,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 4222 treesize of output 4266 [2021-11-19 04:48:31,767 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-19 04:48:31,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:48:31,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2021-11-19 04:48:31,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440540799] [2021-11-19 04:48:31,769 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 04:48:31,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-19 04:48:31,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:48:31,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-19 04:48:31,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3801, Unknown=11, NotChecked=0, Total=4032 [2021-11-19 04:48:31,774 INFO L87 Difference]: Start difference. First operand 243 states and 276 transitions. Second operand has 31 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 6 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-19 04:48:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:48:47,135 INFO L93 Difference]: Finished difference Result 363 states and 419 transitions. [2021-11-19 04:48:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-19 04:48:47,135 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 6 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2021-11-19 04:48:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:48:47,138 INFO L225 Difference]: With dead ends: 363 [2021-11-19 04:48:47,138 INFO L226 Difference]: Without dead ends: 363 [2021-11-19 04:48:47,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=405, Invalid=6717, Unknown=18, NotChecked=0, Total=7140 [2021-11-19 04:48:47,142 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 583 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 5200 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 5398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 5200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-19 04:48:47,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 270 Invalid, 5398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 5200 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-11-19 04:48:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-11-19 04:48:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 269. [2021-11-19 04:48:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 186 states have (on average 1.3494623655913978) internal successors, (251), 232 states have internal predecessors, (251), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (26), 21 states have call predecessors, (26), 24 states have call successors, (26) [2021-11-19 04:48:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 310 transitions. [2021-11-19 04:48:47,177 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 310 transitions. Word has length 69 [2021-11-19 04:48:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:48:47,178 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 310 transitions. [2021-11-19 04:48:47,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 6 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-19 04:48:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 310 transitions. [2021-11-19 04:48:47,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-19 04:48:47,182 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:48:47,182 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:48:47,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-19 04:48:47,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:48:47,406 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting check_seq_nextErr1REQUIRES_VIOLATION === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:48:47,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:48:47,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1390616665, now seen corresponding path program 1 times [2021-11-19 04:48:47,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:48:47,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268023426] [2021-11-19 04:48:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:48:47,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:48:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:48:47,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 04:48:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:48:47,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 04:48:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:48:47,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:48:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:48:48,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:48:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:48:48,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-19 04:48:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:48:50,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-19 04:48:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:48:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-19 04:48:50,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 04:48:50,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268023426] [2021-11-19 04:48:50,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268023426] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 04:48:50,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956301224] [2021-11-19 04:48:50,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:48:50,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:48:50,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 04:48:50,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 04:48:50,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 04:48:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 04:48:51,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 115 conjunts are in the unsatisfiable core [2021-11-19 04:48:51,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 04:48:51,256 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-19 04:48:51,260 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-19 04:48:51,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 04:48:51,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-11-19 04:48:51,925 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-11-19 04:48:51,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2021-11-19 04:48:51,942 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-11-19 04:48:51,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 51 [2021-11-19 04:48:52,355 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-19 04:48:52,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2021-11-19 04:48:52,368 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-19 04:48:52,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2021-11-19 04:49:24,415 INFO L354 Elim1Store]: treesize reduction 271, result has 21.0 percent of original size [2021-11-19 04:49:24,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 167 treesize of output 190 [2021-11-19 04:49:24,600 INFO L354 Elim1Store]: treesize reduction 307, result has 22.3 percent of original size [2021-11-19 04:49:24,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 193 treesize of output 224 [2021-11-19 04:49:24,621 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-19 04:49:24,621 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 259 treesize of output 261 [2021-11-19 04:49:24,649 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-11-19 04:49:24,649 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 258 treesize of output 264 [2021-11-19 04:49:43,526 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 231 treesize of output 230 [2021-11-19 04:50:57,483 INFO L354 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2021-11-19 04:50:57,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 138 [2021-11-19 04:50:57,498 INFO L354 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2021-11-19 04:50:57,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 98 [2021-11-19 04:50:58,061 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-19 04:50:58,062 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 50 treesize of output 52 [2021-11-19 04:50:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 04:50:58,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 04:51:04,944 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 04:51:04,946 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 124481 treesize of output 121241 [2021-11-19 04:51:18,212 WARN L227 SmtUtils]: Spent 13.26s on a formula simplification. DAG size of input: 704 DAG size of output: 684 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 04:51:18,264 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 04:51:18,265 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 116139 treesize of output 116135 [2021-11-19 04:51:20,284 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 04:51:20,285 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 116127 treesize of output 116123 [2021-11-19 04:51:21,685 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-19 04:51:21,685 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 04:51:21,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2021-11-19 04:51:21,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611994358] [2021-11-19 04:51:21,686 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 04:51:21,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-19 04:51:21,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 04:51:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-19 04:51:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3818, Unknown=11, NotChecked=0, Total=4032 [2021-11-19 04:51:21,689 INFO L87 Difference]: Start difference. First operand 269 states and 310 transitions. Second operand has 30 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 6 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-19 04:51:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 04:51:37,341 INFO L93 Difference]: Finished difference Result 359 states and 414 transitions. [2021-11-19 04:51:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-19 04:51:37,341 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 6 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2021-11-19 04:51:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 04:51:37,344 INFO L225 Difference]: With dead ends: 359 [2021-11-19 04:51:37,344 INFO L226 Difference]: Without dead ends: 359 [2021-11-19 04:51:37,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=386, Invalid=6911, Unknown=13, NotChecked=0, Total=7310 [2021-11-19 04:51:37,348 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 475 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 5725 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 5886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 5725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2021-11-19 04:51:37,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 250 Invalid, 5886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 5725 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2021-11-19 04:51:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-11-19 04:51:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 269. [2021-11-19 04:51:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 186 states have (on average 1.3440860215053763) internal successors, (250), 232 states have internal predecessors, (250), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (26), 21 states have call predecessors, (26), 24 states have call successors, (26) [2021-11-19 04:51:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 309 transitions. [2021-11-19 04:51:37,359 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 309 transitions. Word has length 69 [2021-11-19 04:51:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 04:51:37,360 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 309 transitions. [2021-11-19 04:51:37,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 6 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-19 04:51:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 309 transitions. [2021-11-19 04:51:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-19 04:51:37,361 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 04:51:37,361 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:51:37,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-19 04:51:37,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 04:51:37,566 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [remove_fw_linkErr0REQUIRES_VIOLATION, remove_fw_linkErr1REQUIRES_VIOLATION, remove_fw_linkErr2REQUIRES_VIOLATION, remove_fw_linkErr3REQUIRES_VIOLATION (and 79 more)] === [2021-11-19 04:51:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 04:51:37,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1286909006, now seen corresponding path program 1 times [2021-11-19 04:51:37,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 04:51:37,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396728320] [2021-11-19 04:51:37,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 04:51:37,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 04:51:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 04:51:37,624 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 04:51:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 04:51:37,719 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 04:51:37,720 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 04:51:37,721 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (82 of 83 remaining) [2021-11-19 04:51:37,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location remove_fw_linkErr0REQUIRES_VIOLATION (81 of 83 remaining) [2021-11-19 04:51:37,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location remove_fw_linkErr1REQUIRES_VIOLATION (80 of 83 remaining) [2021-11-19 04:51:37,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location remove_fw_linkErr2REQUIRES_VIOLATION (79 of 83 remaining) [2021-11-19 04:51:37,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location remove_fw_linkErr3REQUIRES_VIOLATION (78 of 83 remaining) [2021-11-19 04:51:37,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location alloc_nodeErr0REQUIRES_VIOLATION (77 of 83 remaining) [2021-11-19 04:51:37,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location alloc_nodeErr1REQUIRES_VIOLATION (76 of 83 remaining) [2021-11-19 04:51:37,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location alloc_nodeErr2REQUIRES_VIOLATION (75 of 83 remaining) [2021-11-19 04:51:37,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location alloc_nodeErr3REQUIRES_VIOLATION (74 of 83 remaining) [2021-11-19 04:51:37,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location init_back_linkErr0REQUIRES_VIOLATION (73 of 83 remaining) [2021-11-19 04:51:37,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location init_back_linkErr1REQUIRES_VIOLATION (72 of 83 remaining) [2021-11-19 04:51:37,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location init_back_linkErr2REQUIRES_VIOLATION (71 of 83 remaining) [2021-11-19 04:51:37,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location init_back_linkErr3REQUIRES_VIOLATION (70 of 83 remaining) [2021-11-19 04:51:37,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION (69 of 83 remaining) [2021-11-19 04:51:37,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION (68 of 83 remaining) [2021-11-19 04:51:37,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION (67 of 83 remaining) [2021-11-19 04:51:37,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION (66 of 83 remaining) [2021-11-19 04:51:37,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION (65 of 83 remaining) [2021-11-19 04:51:37,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION (64 of 83 remaining) [2021-11-19 04:51:37,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION (63 of 83 remaining) [2021-11-19 04:51:37,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION (62 of 83 remaining) [2021-11-19 04:51:37,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION (61 of 83 remaining) [2021-11-19 04:51:37,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION (60 of 83 remaining) [2021-11-19 04:51:37,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION (59 of 83 remaining) [2021-11-19 04:51:37,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION (58 of 83 remaining) [2021-11-19 04:51:37,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION (57 of 83 remaining) [2021-11-19 04:51:37,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION (56 of 83 remaining) [2021-11-19 04:51:37,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION (55 of 83 remaining) [2021-11-19 04:51:37,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION (54 of 83 remaining) [2021-11-19 04:51:37,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION (53 of 83 remaining) [2021-11-19 04:51:37,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION (52 of 83 remaining) [2021-11-19 04:51:37,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION (51 of 83 remaining) [2021-11-19 04:51:37,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION (50 of 83 remaining) [2021-11-19 04:51:37,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION (49 of 83 remaining) [2021-11-19 04:51:37,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION (48 of 83 remaining) [2021-11-19 04:51:37,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION (47 of 83 remaining) [2021-11-19 04:51:37,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION (46 of 83 remaining) [2021-11-19 04:51:37,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION (45 of 83 remaining) [2021-11-19 04:51:37,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION (44 of 83 remaining) [2021-11-19 04:51:37,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION (43 of 83 remaining) [2021-11-19 04:51:37,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION (42 of 83 remaining) [2021-11-19 04:51:37,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION (41 of 83 remaining) [2021-11-19 04:51:37,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION (40 of 83 remaining) [2021-11-19 04:51:37,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION (39 of 83 remaining) [2021-11-19 04:51:37,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION (38 of 83 remaining) [2021-11-19 04:51:37,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION (37 of 83 remaining) [2021-11-19 04:51:37,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION (36 of 83 remaining) [2021-11-19 04:51:37,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34ASSERT_VIOLATIONMEMORY_FREE (35 of 83 remaining) [2021-11-19 04:51:37,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35ASSERT_VIOLATIONMEMORY_FREE (34 of 83 remaining) [2021-11-19 04:51:37,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36ASSERT_VIOLATIONMEMORY_FREE (33 of 83 remaining) [2021-11-19 04:51:37,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37ENSURES_VIOLATIONMEMORY_LEAK (32 of 83 remaining) [2021-11-19 04:51:37,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location reverse_dllErr0REQUIRES_VIOLATION (31 of 83 remaining) [2021-11-19 04:51:37,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location reverse_dllErr1REQUIRES_VIOLATION (30 of 83 remaining) [2021-11-19 04:51:37,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location reverse_dllErr2REQUIRES_VIOLATION (29 of 83 remaining) [2021-11-19 04:51:37,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location reverse_dllErr3REQUIRES_VIOLATION (28 of 83 remaining) [2021-11-19 04:51:37,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location reverse_dllErr4REQUIRES_VIOLATION (27 of 83 remaining) [2021-11-19 04:51:37,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location reverse_dllErr5REQUIRES_VIOLATION (26 of 83 remaining) [2021-11-19 04:51:37,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location reverse_dllErr6REQUIRES_VIOLATION (25 of 83 remaining) [2021-11-19 04:51:37,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location reverse_dllErr7REQUIRES_VIOLATION (24 of 83 remaining) [2021-11-19 04:51:37,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_prevErr0REQUIRES_VIOLATION (23 of 83 remaining) [2021-11-19 04:51:37,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_prevErr1REQUIRES_VIOLATION (22 of 83 remaining) [2021-11-19 04:51:37,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_prevErr2REQUIRES_VIOLATION (21 of 83 remaining) [2021-11-19 04:51:37,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_prevErr3REQUIRES_VIOLATION (20 of 83 remaining) [2021-11-19 04:51:37,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_sllErr0REQUIRES_VIOLATION (19 of 83 remaining) [2021-11-19 04:51:37,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_sllErr1REQUIRES_VIOLATION (18 of 83 remaining) [2021-11-19 04:51:37,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_sllErr2REQUIRES_VIOLATION (17 of 83 remaining) [2021-11-19 04:51:37,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_sllErr3REQUIRES_VIOLATION (16 of 83 remaining) [2021-11-19 04:51:37,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_sllErr4REQUIRES_VIOLATION (15 of 83 remaining) [2021-11-19 04:51:37,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_sllErr5REQUIRES_VIOLATION (14 of 83 remaining) [2021-11-19 04:51:37,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_sllErr6REQUIRES_VIOLATION (13 of 83 remaining) [2021-11-19 04:51:37,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_sllErr7REQUIRES_VIOLATION (12 of 83 remaining) [2021-11-19 04:51:37,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_sllErr8REQUIRES_VIOLATION (11 of 83 remaining) [2021-11-19 04:51:37,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_sllErr9REQUIRES_VIOLATION (10 of 83 remaining) [2021-11-19 04:51:37,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr0REQUIRES_VIOLATION (9 of 83 remaining) [2021-11-19 04:51:37,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr1REQUIRES_VIOLATION (8 of 83 remaining) [2021-11-19 04:51:37,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr2REQUIRES_VIOLATION (7 of 83 remaining) [2021-11-19 04:51:37,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr3REQUIRES_VIOLATION (6 of 83 remaining) [2021-11-19 04:51:37,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr4REQUIRES_VIOLATION (5 of 83 remaining) [2021-11-19 04:51:37,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location chain_nodeErr5REQUIRES_VIOLATION (4 of 83 remaining) [2021-11-19 04:51:37,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_nextErr0REQUIRES_VIOLATION (3 of 83 remaining) [2021-11-19 04:51:37,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_nextErr1REQUIRES_VIOLATION (2 of 83 remaining) [2021-11-19 04:51:37,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_nextErr2REQUIRES_VIOLATION (1 of 83 remaining) [2021-11-19 04:51:37,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location check_seq_nextErr3REQUIRES_VIOLATION (0 of 83 remaining) [2021-11-19 04:51:37,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-19 04:51:37,744 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 04:51:37,749 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 04:51:37,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:51:37 BoogieIcfgContainer [2021-11-19 04:51:37,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 04:51:37,816 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 04:51:37,816 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 04:51:37,817 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 04:51:37,817 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:43:50" (3/4) ... [2021-11-19 04:51:37,819 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-19 04:51:37,884 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/witness.graphml [2021-11-19 04:51:37,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 04:51:37,886 INFO L158 Benchmark]: Toolchain (without parser) took 469777.96ms. Allocated memory was 90.2MB in the beginning and 469.8MB in the end (delta: 379.6MB). Free memory was 53.8MB in the beginning and 340.6MB in the end (delta: -286.8MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2021-11-19 04:51:37,886 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 90.2MB. Free memory was 61.0MB in the beginning and 61.0MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 04:51:37,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.25ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 53.6MB in the beginning and 81.5MB in the end (delta: -27.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-19 04:51:37,887 INFO L158 Benchmark]: Boogie Preprocessor took 160.70ms. Allocated memory is still 115.3MB. Free memory was 81.5MB in the beginning and 77.9MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 04:51:37,887 INFO L158 Benchmark]: RCFGBuilder took 1196.94ms. Allocated memory is still 115.3MB. Free memory was 77.9MB in the beginning and 43.2MB in the end (delta: 34.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-11-19 04:51:37,890 INFO L158 Benchmark]: TraceAbstraction took 467695.31ms. Allocated memory was 115.3MB in the beginning and 469.8MB in the end (delta: 354.4MB). Free memory was 43.2MB in the beginning and 344.8MB in the end (delta: -301.6MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2021-11-19 04:51:37,890 INFO L158 Benchmark]: Witness Printer took 68.65ms. Allocated memory is still 469.8MB. Free memory was 343.7MB in the beginning and 340.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-19 04:51:37,897 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.34ms. Allocated memory is still 90.2MB. Free memory was 61.0MB in the beginning and 61.0MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.25ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 53.6MB in the beginning and 81.5MB in the end (delta: -27.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 160.70ms. Allocated memory is still 115.3MB. Free memory was 81.5MB in the beginning and 77.9MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1196.94ms. Allocated memory is still 115.3MB. Free memory was 77.9MB in the beginning and 43.2MB in the end (delta: 34.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 467695.31ms. Allocated memory was 115.3MB in the beginning and 469.8MB in the end (delta: 354.4MB). Free memory was 43.2MB in the beginning and 344.8MB in the end (delta: -301.6MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Witness Printer took 68.65ms. Allocated memory is still 469.8MB. Free memory was 343.7MB in the beginning and 340.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L639] const struct node *p1, *p2; VAL [p1={6:0}, p2={7:0}] [L640] CALL, EXPR create_sll(&p1, &p2) VAL [pp1={6:0}, pp2={7:0}] [L588] struct node *list = ((void *)0); VAL [list={5:0}, pp1={6:0}, pp1={6:0}, pp2={7:0}, pp2={7:0}] [L590] CALL chain_node(&list) VAL [ppnode={5:0}] [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={3:0}] [L576] ptr->next = ((void *)0) VAL [ptr={3:0}] [L577] ptr->prev = ((void *)0) VAL [ptr={3:0}] [L578] return ptr; VAL [\result={3:0}, ptr={3:0}] [L582] RET, EXPR alloc_node() VAL [alloc_node()={3:0}, ppnode={5:0}, ppnode={5:0}] [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) VAL [\read(**ppnode)={0:0}, node={3:0}, ppnode={5:0}, ppnode={5:0}] [L583] node->next = *ppnode VAL [\read(**ppnode)={0:0}, node={3:0}, ppnode={5:0}, ppnode={5:0}] [L584] *ppnode = node VAL [node={3:0}, ppnode={5:0}, ppnode={5:0}] [L590] RET chain_node(&list) VAL [list={5:0}, pp1={6:0}, pp1={6:0}, pp2={7:0}, pp2={7:0}] [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) VAL [\read(*list)={3:0}, list={5:0}, pp1={6:0}, pp1={6:0}, pp2={7:0}, pp2={7:0}] [L592] *pp2 = list VAL [\read(*list)={3:0}, list={5:0}, pp1={6:0}, pp1={6:0}, pp2={7:0}, pp2={7:0}] [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) VAL [\read(*list)={3:0}, list={5:0}, pp1={6:0}, pp1={6:0}, pp2={7:0}, pp2={7:0}] [L595] *pp1 = list VAL [\read(*list)={3:0}, list={5:0}, pp1={6:0}, pp1={6:0}, pp2={7:0}, pp2={7:0}] [L597] CALL chain_node(&list) VAL [ppnode={5:0}] [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-1:0}] [L576] ptr->next = ((void *)0) VAL [ptr={-1:0}] [L577] ptr->prev = ((void *)0) VAL [ptr={-1:0}] [L578] return ptr; VAL [\result={-1:0}, ptr={-1:0}] [L582] RET, EXPR alloc_node() VAL [alloc_node()={-1:0}, ppnode={5:0}, ppnode={5:0}] [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) VAL [\read(**ppnode)={3:0}, node={-1:0}, ppnode={5:0}, ppnode={5:0}] [L583] node->next = *ppnode VAL [\read(**ppnode)={3:0}, node={-1:0}, ppnode={5:0}, ppnode={5:0}] [L584] *ppnode = node VAL [node={-1:0}, ppnode={5:0}, ppnode={5:0}] [L597] RET chain_node(&list) VAL [list={5:0}, pp1={6:0}, pp1={6:0}, pp2={7:0}, pp2={7:0}] [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) VAL [\read(*list)={-1:0}, list={5:0}, pp1={6:0}, pp1={6:0}, pp2={7:0}, pp2={7:0}] [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; VAL [\result={-1:0}, pp1={6:0}, pp1={6:0}, pp2={7:0}, pp2={7:0}] [L640] RET, EXPR create_sll(&p1, &p2) VAL [create_sll(&p1, &p2)={-1:0}, p1={6:0}, p2={7:0}] [L640] struct node *list = create_sll(&p1, &p2); [L642] EXPR \read(*p1) VAL [\read(*p1)={3:0}, list={-1:0}, p1={6:0}, p2={7:0}] [L642] EXPR \read(*p2) VAL [\read(*p1)={3:0}, \read(*p2)={3:0}, list={-1:0}, p1={6:0}, p2={7:0}] [L642] CALL check_seq_next(p1, p2) VAL [beg={3:0}, end={3:0}] [L626] COND FALSE !(!(beg)) VAL [beg={3:0}, beg={3:0}, end={3:0}, end={3:0}] [L627] COND FALSE !(!(end)) VAL [beg={3:0}, beg={3:0}, end={3:0}, end={3:0}] [L628] EXPR beg->next VAL [beg={3:0}, beg={3:0}, beg->next={0:0}, end={3:0}, end={3:0}] [L628] beg = beg->next [L628] COND TRUE end != beg VAL [beg={0:0}, beg={3:0}, end={3:0}, end={3:0}] [L629] COND TRUE !(beg) VAL [beg={0:0}, beg={3:0}, end={3:0}, end={3:0}] [L629] CALL fail() [L565] reach_error() - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 657]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 657]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 253 locations, 83 error locations. Started 1 CEGAR loops. OverallTime: 467.5s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 96.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9028 SdHoareTripleChecker+Valid, 35.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8836 mSDsluCounter, 6030 SdHoareTripleChecker+Invalid, 30.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1430 IncrementalHoareTripleChecker+Unchecked, 2412 mSDsCounter, 2143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39472 IncrementalHoareTripleChecker+Invalid, 43045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2143 mSolverCounterUnsat, 3618 mSDtfsCounter, 39472 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 991 GetRequests, 385 SyntacticMatches, 15 SemanticMatches, 591 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7898 ImplicationChecksByTransitivity, 199.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=20, InterpolantAutomatonStates: 295, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 877 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 58.4s InterpolantComputationTime, 1036 NumberOfCodeBlocks, 1036 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 938 ConstructedInterpolants, 34 QuantifiedInterpolants, 23717 SizeOfPredicates, 32 NumberOfNonLiveVariables, 908 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 24 InterpolantComputations, 16 PerfectInterpolantSequences, 105/182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-19 04:51:38,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4fbad14-9e1d-4bb5-951a-0df03e6e156f/bin/uautomizer-ZXIjhQolGL/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)