./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a71ed7b24cb625c47cfb1b6ba9f6cdbf2879f063 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:48:15,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:48:15,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:48:15,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:48:15,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:48:15,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:48:15,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:48:15,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:48:15,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:48:15,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:48:15,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:48:15,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:48:15,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:48:15,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:48:15,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:48:15,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:48:15,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:48:15,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:48:15,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:48:15,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:48:15,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:48:15,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:48:15,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:48:15,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:48:15,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:48:15,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:48:15,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:48:15,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:48:15,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:48:15,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:48:15,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:48:15,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:48:15,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:48:15,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:48:15,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:48:15,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:48:15,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:48:15,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:48:15,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:48:15,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:48:15,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:48:15,752 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-13 07:48:15,800 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:48:15,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:48:15,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:48:15,802 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:48:15,803 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:48:15,803 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:48:15,803 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:48:15,803 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:48:15,803 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:48:15,804 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:48:15,805 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:48:15,805 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:48:15,805 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:48:15,805 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:48:15,806 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:48:15,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 07:48:15,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 07:48:15,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:48:15,807 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:48:15,808 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 07:48:15,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:48:15,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:48:15,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:48:15,808 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 07:48:15,809 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 07:48:15,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:48:15,811 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:48:15,811 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:48:15,811 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:48:15,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:48:15,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:48:15,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:48:15,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:48:15,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:48:15,813 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:48:15,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:48:15,813 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:48:15,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:48:15,814 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/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_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a71ed7b24cb625c47cfb1b6ba9f6cdbf2879f063 [2021-10-13 07:48:16,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:48:16,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:48:16,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:48:16,141 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:48:16,142 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:48:16,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-10-13 07:48:16,224 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/data/af1cf6dd1/1922c52e4c294b529b20e4a17375dd31/FLAG22aa3a962 [2021-10-13 07:48:16,910 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:48:16,910 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-10-13 07:48:16,937 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/data/af1cf6dd1/1922c52e4c294b529b20e4a17375dd31/FLAG22aa3a962 [2021-10-13 07:48:17,140 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/data/af1cf6dd1/1922c52e4c294b529b20e4a17375dd31 [2021-10-13 07:48:17,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:48:17,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:48:17,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:48:17,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:48:17,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:48:17,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d33ab89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17, skipping insertion in model container [2021-10-13 07:48:17,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:48:17,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:48:17,544 WARN L228 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_a1c08dc3-7658-4e78-904f-fe7ec492612c/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-10-13 07:48:17,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:48:17,612 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:48:17,677 WARN L228 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_a1c08dc3-7658-4e78-904f-fe7ec492612c/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-10-13 07:48:17,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:48:17,744 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:48:17,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17 WrapperNode [2021-10-13 07:48:17,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:48:17,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:48:17,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:48:17,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:48:17,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:48:17,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:48:17,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:48:17,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:48:17,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:48:17,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:48:17,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:48:17,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:48:17,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (1/1) ... [2021-10-13 07:48:17,916 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:48:17,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:48:17,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:48:17,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:48:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 07:48:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 07:48:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:48:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 07:48:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 07:48:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-13 07:48:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:48:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:48:17,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:48:19,264 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:48:19,265 INFO L299 CfgBuilder]: Removed 137 assume(true) statements. [2021-10-13 07:48:19,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:48:19 BoogieIcfgContainer [2021-10-13 07:48:19,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:48:19,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:48:19,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:48:19,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:48:19,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:48:17" (1/3) ... [2021-10-13 07:48:19,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4fead3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:48:19, skipping insertion in model container [2021-10-13 07:48:19,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:48:17" (2/3) ... [2021-10-13 07:48:19,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4fead3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:48:19, skipping insertion in model container [2021-10-13 07:48:19,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:48:19" (3/3) ... [2021-10-13 07:48:19,300 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2021-10-13 07:48:19,307 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:48:19,307 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2021-10-13 07:48:19,348 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:48:19,354 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, mConcurrency=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-10-13 07:48:19,355 INFO L340 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2021-10-13 07:48:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 144 states have (on average 2.5208333333333335) internal successors, (363), 282 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 07:48:19,382 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:19,383 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 07:48:19,383 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:19,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash 883824, now seen corresponding path program 1 times [2021-10-13 07:48:19,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:19,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064160190] [2021-10-13 07:48:19,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:19,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:19,616 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:19,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064160190] [2021-10-13 07:48:19,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064160190] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:19,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:19,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:48:19,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880010912] [2021-10-13 07:48:19,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:48:19,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:19,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:48:19,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:19,668 INFO L87 Difference]: Start difference. First operand has 283 states, 144 states have (on average 2.5208333333333335) internal successors, (363), 282 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:19,960 INFO L93 Difference]: Finished difference Result 278 states and 290 transitions. [2021-10-13 07:48:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:48:19,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 07:48:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:19,982 INFO L225 Difference]: With dead ends: 278 [2021-10-13 07:48:19,983 INFO L226 Difference]: Without dead ends: 277 [2021-10-13 07:48:19,985 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-10-13 07:48:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2021-10-13 07:48:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 144 states have (on average 2.0) internal successors, (288), 275 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 288 transitions. [2021-10-13 07:48:20,053 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 288 transitions. Word has length 3 [2021-10-13 07:48:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:20,054 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 288 transitions. [2021-10-13 07:48:20,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 288 transitions. [2021-10-13 07:48:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 07:48:20,055 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:20,056 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 07:48:20,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:48:20,056 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:20,060 INFO L82 PathProgramCache]: Analyzing trace with hash 883825, now seen corresponding path program 1 times [2021-10-13 07:48:20,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:20,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324423432] [2021-10-13 07:48:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:20,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:20,155 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:20,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324423432] [2021-10-13 07:48:20,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324423432] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:20,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:20,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:48:20,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760253146] [2021-10-13 07:48:20,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:48:20,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:48:20,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:20,162 INFO L87 Difference]: Start difference. First operand 276 states and 288 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:20,349 INFO L93 Difference]: Finished difference Result 271 states and 283 transitions. [2021-10-13 07:48:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:48:20,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 07:48:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:20,351 INFO L225 Difference]: With dead ends: 271 [2021-10-13 07:48:20,351 INFO L226 Difference]: Without dead ends: 271 [2021-10-13 07:48:20,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:48:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-10-13 07:48:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2021-10-13 07:48:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 144 states have (on average 1.9583333333333333) internal successors, (282), 269 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 282 transitions. [2021-10-13 07:48:20,372 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 282 transitions. Word has length 3 [2021-10-13 07:48:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:20,372 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 282 transitions. [2021-10-13 07:48:20,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 282 transitions. [2021-10-13 07:48:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 07:48:20,373 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:20,373 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 07:48:20,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:48:20,373 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:20,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:20,374 INFO L82 PathProgramCache]: Analyzing trace with hash 849381547, now seen corresponding path program 1 times [2021-10-13 07:48:20,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:20,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137745478] [2021-10-13 07:48:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:20,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:20,456 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:20,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137745478] [2021-10-13 07:48:20,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137745478] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:20,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:20,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:48:20,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524312028] [2021-10-13 07:48:20,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:48:20,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:20,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:48:20,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:48:20,459 INFO L87 Difference]: Start difference. First operand 270 states and 282 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:20,721 INFO L93 Difference]: Finished difference Result 262 states and 274 transitions. [2021-10-13 07:48:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:20,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-13 07:48:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:20,724 INFO L225 Difference]: With dead ends: 262 [2021-10-13 07:48:20,724 INFO L226 Difference]: Without dead ends: 262 [2021-10-13 07:48:20,724 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:48:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-13 07:48:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2021-10-13 07:48:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 144 states have (on average 1.8958333333333333) internal successors, (273), 260 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 273 transitions. [2021-10-13 07:48:20,732 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 273 transitions. Word has length 5 [2021-10-13 07:48:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:20,732 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 273 transitions. [2021-10-13 07:48:20,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 273 transitions. [2021-10-13 07:48:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 07:48:20,733 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:20,733 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 07:48:20,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:48:20,733 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:20,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:20,734 INFO L82 PathProgramCache]: Analyzing trace with hash 849381548, now seen corresponding path program 1 times [2021-10-13 07:48:20,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:20,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756304996] [2021-10-13 07:48:20,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:20,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:20,802 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:20,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756304996] [2021-10-13 07:48:20,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756304996] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:20,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:20,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:48:20,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808804464] [2021-10-13 07:48:20,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:20,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:20,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:20,804 INFO L87 Difference]: Start difference. First operand 261 states and 273 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:21,127 INFO L93 Difference]: Finished difference Result 253 states and 265 transitions. [2021-10-13 07:48:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:48:21,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-13 07:48:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:21,129 INFO L225 Difference]: With dead ends: 253 [2021-10-13 07:48:21,129 INFO L226 Difference]: Without dead ends: 253 [2021-10-13 07:48:21,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:48:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-13 07:48:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-10-13 07:48:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 144 states have (on average 1.8333333333333333) internal successors, (264), 251 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-10-13 07:48:21,145 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 5 [2021-10-13 07:48:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:21,145 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-10-13 07:48:21,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-10-13 07:48:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 07:48:21,146 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:21,146 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 07:48:21,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:48:21,147 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash 561024176, now seen corresponding path program 1 times [2021-10-13 07:48:21,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:21,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023811418] [2021-10-13 07:48:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:21,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:21,229 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:21,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023811418] [2021-10-13 07:48:21,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023811418] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:21,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:21,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:48:21,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409515728] [2021-10-13 07:48:21,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:21,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:21,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:21,232 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:21,447 INFO L93 Difference]: Finished difference Result 250 states and 262 transitions. [2021-10-13 07:48:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:21,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 07:48:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:21,449 INFO L225 Difference]: With dead ends: 250 [2021-10-13 07:48:21,449 INFO L226 Difference]: Without dead ends: 250 [2021-10-13 07:48:21,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:48:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-10-13 07:48:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2021-10-13 07:48:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 144 states have (on average 1.8125) internal successors, (261), 248 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 261 transitions. [2021-10-13 07:48:21,457 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 261 transitions. Word has length 6 [2021-10-13 07:48:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:21,457 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 261 transitions. [2021-10-13 07:48:21,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 261 transitions. [2021-10-13 07:48:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 07:48:21,458 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:21,458 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 07:48:21,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:48:21,459 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:21,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:21,459 INFO L82 PathProgramCache]: Analyzing trace with hash 561024177, now seen corresponding path program 1 times [2021-10-13 07:48:21,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:21,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862252528] [2021-10-13 07:48:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:21,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:21,573 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:21,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862252528] [2021-10-13 07:48:21,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862252528] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:21,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:21,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:48:21,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137113104] [2021-10-13 07:48:21,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:21,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:21,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:21,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:21,576 INFO L87 Difference]: Start difference. First operand 249 states and 261 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:21,744 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2021-10-13 07:48:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:21,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 07:48:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:21,750 INFO L225 Difference]: With dead ends: 247 [2021-10-13 07:48:21,750 INFO L226 Difference]: Without dead ends: 247 [2021-10-13 07:48:21,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:48:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-13 07:48:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2021-10-13 07:48:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 144 states have (on average 1.7916666666666667) internal successors, (258), 245 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 258 transitions. [2021-10-13 07:48:21,759 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 258 transitions. Word has length 6 [2021-10-13 07:48:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:21,759 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 258 transitions. [2021-10-13 07:48:21,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 258 transitions. [2021-10-13 07:48:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 07:48:21,760 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:21,760 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:48:21,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:48:21,761 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:21,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:21,761 INFO L82 PathProgramCache]: Analyzing trace with hash -654503221, now seen corresponding path program 1 times [2021-10-13 07:48:21,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:21,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681127549] [2021-10-13 07:48:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:21,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:21,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:21,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681127549] [2021-10-13 07:48:21,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681127549] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:21,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:21,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:48:21,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688915985] [2021-10-13 07:48:21,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:21,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:21,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:21,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:21,933 INFO L87 Difference]: Start difference. First operand 246 states and 258 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:22,191 INFO L93 Difference]: Finished difference Result 245 states and 257 transitions. [2021-10-13 07:48:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 07:48:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:22,192 INFO L225 Difference]: With dead ends: 245 [2021-10-13 07:48:22,192 INFO L226 Difference]: Without dead ends: 245 [2021-10-13 07:48:22,192 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-13 07:48:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-10-13 07:48:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 144 states have (on average 1.7847222222222223) internal successors, (257), 244 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 257 transitions. [2021-10-13 07:48:22,197 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 257 transitions. Word has length 10 [2021-10-13 07:48:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:22,198 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 257 transitions. [2021-10-13 07:48:22,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 257 transitions. [2021-10-13 07:48:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 07:48:22,198 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:22,198 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:48:22,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:48:22,199 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:22,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash -654503222, now seen corresponding path program 1 times [2021-10-13 07:48:22,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:22,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053122262] [2021-10-13 07:48:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:22,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:22,337 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:22,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053122262] [2021-10-13 07:48:22,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053122262] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:22,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:22,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:48:22,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061665032] [2021-10-13 07:48:22,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:48:22,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:22,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:48:22,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:48:22,339 INFO L87 Difference]: Start difference. First operand 245 states and 257 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:22,533 INFO L93 Difference]: Finished difference Result 244 states and 256 transitions. [2021-10-13 07:48:22,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:48:22,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 07:48:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:22,535 INFO L225 Difference]: With dead ends: 244 [2021-10-13 07:48:22,535 INFO L226 Difference]: Without dead ends: 244 [2021-10-13 07:48:22,535 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.9ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:48:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-13 07:48:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-10-13 07:48:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 144 states have (on average 1.7777777777777777) internal successors, (256), 243 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 256 transitions. [2021-10-13 07:48:22,541 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 256 transitions. Word has length 10 [2021-10-13 07:48:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:22,541 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 256 transitions. [2021-10-13 07:48:22,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 256 transitions. [2021-10-13 07:48:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 07:48:22,542 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:22,542 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:48:22,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:48:22,543 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:22,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1226462896, now seen corresponding path program 1 times [2021-10-13 07:48:22,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:22,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962926201] [2021-10-13 07:48:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:22,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:22,690 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:22,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962926201] [2021-10-13 07:48:22,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962926201] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:22,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:22,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:48:22,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744375712] [2021-10-13 07:48:22,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:48:22,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:22,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:48:22,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:48:22,698 INFO L87 Difference]: Start difference. First operand 244 states and 256 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:22,913 INFO L93 Difference]: Finished difference Result 243 states and 255 transitions. [2021-10-13 07:48:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:48:22,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-13 07:48:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:22,915 INFO L225 Difference]: With dead ends: 243 [2021-10-13 07:48:22,915 INFO L226 Difference]: Without dead ends: 243 [2021-10-13 07:48:22,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.0ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:48:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-10-13 07:48:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-10-13 07:48:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 242 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 255 transitions. [2021-10-13 07:48:22,930 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 255 transitions. Word has length 14 [2021-10-13 07:48:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:22,930 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 255 transitions. [2021-10-13 07:48:22,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 255 transitions. [2021-10-13 07:48:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 07:48:22,931 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:22,931 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:48:22,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:48:22,931 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1226462897, now seen corresponding path program 1 times [2021-10-13 07:48:22,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:22,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823622075] [2021-10-13 07:48:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:22,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:23,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-10-13 07:48:23,042 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:23,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823622075] [2021-10-13 07:48:23,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823622075] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:23,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:23,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:48:23,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671421750] [2021-10-13 07:48:23,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:48:23,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:23,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:48:23,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:23,045 INFO L87 Difference]: Start difference. First operand 243 states and 255 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:23,274 INFO L93 Difference]: Finished difference Result 242 states and 254 transitions. [2021-10-13 07:48:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-13 07:48:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:23,276 INFO L225 Difference]: With dead ends: 242 [2021-10-13 07:48:23,276 INFO L226 Difference]: Without dead ends: 242 [2021-10-13 07:48:23,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:48:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-13 07:48:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-10-13 07:48:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 144 states have (on average 1.7638888888888888) internal successors, (254), 241 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 254 transitions. [2021-10-13 07:48:23,282 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 254 transitions. Word has length 14 [2021-10-13 07:48:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:23,283 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 254 transitions. [2021-10-13 07:48:23,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 254 transitions. [2021-10-13 07:48:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 07:48:23,284 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:23,284 INFO L512 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] [2021-10-13 07:48:23,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:48:23,284 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:23,285 INFO L82 PathProgramCache]: Analyzing trace with hash 640226691, now seen corresponding path program 1 times [2021-10-13 07:48:23,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:23,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158721465] [2021-10-13 07:48:23,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:23,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:23,390 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:23,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158721465] [2021-10-13 07:48:23,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158721465] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:23,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:23,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:48:23,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670889486] [2021-10-13 07:48:23,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:48:23,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:23,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:48:23,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:48:23,392 INFO L87 Difference]: Start difference. First operand 242 states and 254 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:23,593 INFO L93 Difference]: Finished difference Result 245 states and 258 transitions. [2021-10-13 07:48:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:23,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 07:48:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:23,595 INFO L225 Difference]: With dead ends: 245 [2021-10-13 07:48:23,595 INFO L226 Difference]: Without dead ends: 245 [2021-10-13 07:48:23,595 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:48:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-13 07:48:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 235. [2021-10-13 07:48:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 144 states have (on average 1.7152777777777777) internal successors, (247), 234 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 247 transitions. [2021-10-13 07:48:23,600 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 247 transitions. Word has length 24 [2021-10-13 07:48:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:23,601 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 247 transitions. [2021-10-13 07:48:23,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 247 transitions. [2021-10-13 07:48:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 07:48:23,602 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:23,602 INFO L512 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] [2021-10-13 07:48:23,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:48:23,602 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:23,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:23,603 INFO L82 PathProgramCache]: Analyzing trace with hash 640226692, now seen corresponding path program 1 times [2021-10-13 07:48:23,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:23,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868390764] [2021-10-13 07:48:23,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:23,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:23,686 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:23,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868390764] [2021-10-13 07:48:23,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868390764] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:23,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:23,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:48:23,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724788930] [2021-10-13 07:48:23,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:48:23,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:23,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:48:23,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:48:23,692 INFO L87 Difference]: Start difference. First operand 235 states and 247 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:23,880 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2021-10-13 07:48:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:23,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 07:48:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:23,882 INFO L225 Difference]: With dead ends: 238 [2021-10-13 07:48:23,883 INFO L226 Difference]: Without dead ends: 238 [2021-10-13 07:48:23,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:48:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-13 07:48:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 228. [2021-10-13 07:48:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 144 states have (on average 1.6666666666666667) internal successors, (240), 227 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 240 transitions. [2021-10-13 07:48:23,888 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 240 transitions. Word has length 24 [2021-10-13 07:48:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:23,888 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 240 transitions. [2021-10-13 07:48:23,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 240 transitions. [2021-10-13 07:48:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:48:23,889 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:23,889 INFO L512 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] [2021-10-13 07:48:23,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:48:23,890 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:23,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1627808933, now seen corresponding path program 1 times [2021-10-13 07:48:23,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:23,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155030584] [2021-10-13 07:48:23,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:23,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:23,964 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:23,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155030584] [2021-10-13 07:48:23,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155030584] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:23,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:23,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:48:23,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337505027] [2021-10-13 07:48:23,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:48:23,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:23,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:48:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:48:23,970 INFO L87 Difference]: Start difference. First operand 228 states and 240 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:24,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:24,174 INFO L93 Difference]: Finished difference Result 231 states and 244 transitions. [2021-10-13 07:48:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:24,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 07:48:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:24,176 INFO L225 Difference]: With dead ends: 231 [2021-10-13 07:48:24,176 INFO L226 Difference]: Without dead ends: 231 [2021-10-13 07:48:24,176 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.8ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:48:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-10-13 07:48:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2021-10-13 07:48:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 144 states have (on average 1.6180555555555556) internal successors, (233), 220 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 233 transitions. [2021-10-13 07:48:24,181 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 233 transitions. Word has length 25 [2021-10-13 07:48:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:24,182 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 233 transitions. [2021-10-13 07:48:24,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 233 transitions. [2021-10-13 07:48:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:48:24,182 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:24,183 INFO L512 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] [2021-10-13 07:48:24,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:48:24,183 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1627808932, now seen corresponding path program 1 times [2021-10-13 07:48:24,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:24,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953368688] [2021-10-13 07:48:24,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:24,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:24,281 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:24,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953368688] [2021-10-13 07:48:24,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953368688] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:24,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:24,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:48:24,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701738723] [2021-10-13 07:48:24,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:48:24,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:24,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:48:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:48:24,284 INFO L87 Difference]: Start difference. First operand 221 states and 233 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:24,462 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2021-10-13 07:48:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:48:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 07:48:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:24,464 INFO L225 Difference]: With dead ends: 224 [2021-10-13 07:48:24,464 INFO L226 Difference]: Without dead ends: 224 [2021-10-13 07:48:24,464 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 31.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:48:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-10-13 07:48:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2021-10-13 07:48:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 144 states have (on average 1.5694444444444444) internal successors, (226), 213 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 226 transitions. [2021-10-13 07:48:24,470 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 226 transitions. Word has length 25 [2021-10-13 07:48:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:24,470 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 226 transitions. [2021-10-13 07:48:24,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 226 transitions. [2021-10-13 07:48:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:48:24,471 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:24,471 INFO L512 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] [2021-10-13 07:48:24,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 07:48:24,471 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:24,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:24,472 INFO L82 PathProgramCache]: Analyzing trace with hash -955589745, now seen corresponding path program 1 times [2021-10-13 07:48:24,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:24,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173635110] [2021-10-13 07:48:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:24,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:24,989 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:24,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173635110] [2021-10-13 07:48:24,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173635110] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:24,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:24,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-13 07:48:24,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054988413] [2021-10-13 07:48:24,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-13 07:48:24,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:24,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-13 07:48:24,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-10-13 07:48:24,991 INFO L87 Difference]: Start difference. First operand 214 states and 226 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:26,789 INFO L93 Difference]: Finished difference Result 406 states and 429 transitions. [2021-10-13 07:48:26,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 07:48:26,790 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 07:48:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:26,793 INFO L225 Difference]: With dead ends: 406 [2021-10-13 07:48:26,793 INFO L226 Difference]: Without dead ends: 406 [2021-10-13 07:48:26,794 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1203.6ms TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2021-10-13 07:48:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-10-13 07:48:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 226. [2021-10-13 07:48:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 225 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 239 transitions. [2021-10-13 07:48:26,802 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 239 transitions. Word has length 27 [2021-10-13 07:48:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:26,802 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 239 transitions. [2021-10-13 07:48:26,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 239 transitions. [2021-10-13 07:48:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 07:48:26,803 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:26,804 INFO L512 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-10-13 07:48:26,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 07:48:26,804 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:26,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:26,805 INFO L82 PathProgramCache]: Analyzing trace with hash 801448723, now seen corresponding path program 1 times [2021-10-13 07:48:26,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:26,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295188074] [2021-10-13 07:48:26,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:26,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:27,190 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:27,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295188074] [2021-10-13 07:48:27,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295188074] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:27,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:27,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-13 07:48:27,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132807761] [2021-10-13 07:48:27,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-13 07:48:27,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-13 07:48:27,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-10-13 07:48:27,192 INFO L87 Difference]: Start difference. First operand 226 states and 239 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:28,673 INFO L93 Difference]: Finished difference Result 488 states and 518 transitions. [2021-10-13 07:48:28,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 07:48:28,674 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-13 07:48:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:28,677 INFO L225 Difference]: With dead ends: 488 [2021-10-13 07:48:28,677 INFO L226 Difference]: Without dead ends: 488 [2021-10-13 07:48:28,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 765.1ms TimeCoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2021-10-13 07:48:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-10-13 07:48:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 268. [2021-10-13 07:48:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 198 states have (on average 1.5101010101010102) internal successors, (299), 267 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 299 transitions. [2021-10-13 07:48:28,687 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 299 transitions. Word has length 29 [2021-10-13 07:48:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:28,687 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 299 transitions. [2021-10-13 07:48:28,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 299 transitions. [2021-10-13 07:48:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 07:48:28,692 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:28,692 INFO L512 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] [2021-10-13 07:48:28,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 07:48:28,692 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash -924887149, now seen corresponding path program 1 times [2021-10-13 07:48:28,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:28,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51171048] [2021-10-13 07:48:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:28,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:29,347 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:29,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51171048] [2021-10-13 07:48:29,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51171048] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:29,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:29,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-13 07:48:29,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306421598] [2021-10-13 07:48:29,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-13 07:48:29,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-13 07:48:29,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-10-13 07:48:29,349 INFO L87 Difference]: Start difference. First operand 268 states and 299 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:31,023 INFO L93 Difference]: Finished difference Result 416 states and 455 transitions. [2021-10-13 07:48:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 07:48:31,024 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-13 07:48:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:31,027 INFO L225 Difference]: With dead ends: 416 [2021-10-13 07:48:31,027 INFO L226 Difference]: Without dead ends: 416 [2021-10-13 07:48:31,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1001.3ms TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2021-10-13 07:48:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-10-13 07:48:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 267. [2021-10-13 07:48:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 198 states have (on average 1.5) internal successors, (297), 266 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2021-10-13 07:48:31,035 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 30 [2021-10-13 07:48:31,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:31,036 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2021-10-13 07:48:31,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2021-10-13 07:48:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 07:48:31,036 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:31,037 INFO L512 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] [2021-10-13 07:48:31,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 07:48:31,049 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash -924887148, now seen corresponding path program 1 times [2021-10-13 07:48:31,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:31,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253742762] [2021-10-13 07:48:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:31,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:48:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:48:31,749 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:48:31,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253742762] [2021-10-13 07:48:31,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253742762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:48:31,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:48:31,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-13 07:48:31,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626922317] [2021-10-13 07:48:31,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-13 07:48:31,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:48:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-13 07:48:31,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-10-13 07:48:31,752 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:48:33,874 INFO L93 Difference]: Finished difference Result 445 states and 484 transitions. [2021-10-13 07:48:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 07:48:33,875 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-13 07:48:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:48:33,877 INFO L225 Difference]: With dead ends: 445 [2021-10-13 07:48:33,877 INFO L226 Difference]: Without dead ends: 445 [2021-10-13 07:48:33,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1293.7ms TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2021-10-13 07:48:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-10-13 07:48:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 271. [2021-10-13 07:48:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 202 states have (on average 1.49009900990099) internal successors, (301), 270 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 301 transitions. [2021-10-13 07:48:33,886 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 301 transitions. Word has length 30 [2021-10-13 07:48:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:48:33,886 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 301 transitions. [2021-10-13 07:48:33,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:48:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 301 transitions. [2021-10-13 07:48:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 07:48:33,887 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:48:33,887 INFO L512 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] [2021-10-13 07:48:33,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 07:48:33,887 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-13 07:48:33,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:48:33,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1077683325, now seen corresponding path program 1 times [2021-10-13 07:48:33,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:48:33,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235610467] [2021-10-13 07:48:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:48:33,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:48:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:48:33,996 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 07:48:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:48:34,117 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 07:48:34,117 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 07:48:34,118 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-13 07:48:34,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 07:48:34,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 07:48:34,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-13 07:48:34,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 07:48:34,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 07:48:34,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-13 07:48:34,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 07:48:34,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-13 07:48:34,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 07:48:34,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-13 07:48:34,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-13 07:48:34,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-13 07:48:34,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-13 07:48:34,122 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-13 07:48:34,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-13 07:48:34,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-13 07:48:34,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-13 07:48:34,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-13 07:48:34,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-13 07:48:34,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-13 07:48:34,123 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-13 07:48:34,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-13 07:48:34,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-13 07:48:34,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-13 07:48:34,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-13 07:48:34,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-13 07:48:34,124 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-13 07:48:34,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-13 07:48:34,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-13 07:48:34,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-13 07:48:34,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-13 07:48:34,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-13 07:48:34,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-13 07:48:34,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-13 07:48:34,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-13 07:48:34,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-13 07:48:34,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-13 07:48:34,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-13 07:48:34,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-13 07:48:34,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-13 07:48:34,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-13 07:48:34,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-13 07:48:34,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-13 07:48:34,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-13 07:48:34,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-13 07:48:34,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-13 07:48:34,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-13 07:48:34,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-13 07:48:34,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-13 07:48:34,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-13 07:48:34,129 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-13 07:48:34,129 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,129 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-13 07:48:34,129 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-13 07:48:34,129 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-13 07:48:34,129 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-13 07:48:34,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-13 07:48:34,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-13 07:48:34,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-13 07:48:34,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-13 07:48:34,130 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-13 07:48:34,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-13 07:48:34,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-10-13 07:48:34,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-13 07:48:34,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,131 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-13 07:48:34,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-13 07:48:34,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-13 07:48:34,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-13 07:48:34,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-13 07:48:34,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-10-13 07:48:34,132 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-13 07:48:34,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-13 07:48:34,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-10-13 07:48:34,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-13 07:48:34,134 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,134 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-13 07:48:34,134 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-13 07:48:34,134 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-10-13 07:48:34,134 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-13 07:48:34,134 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-13 07:48:34,134 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-13 07:48:34,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-13 07:48:34,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-13 07:48:34,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-13 07:48:34,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-10-13 07:48:34,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-13 07:48:34,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-13 07:48:34,136 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-10-13 07:48:34,136 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-13 07:48:34,136 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,136 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,136 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-10-13 07:48:34,136 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-10-13 07:48:34,137 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,137 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-10-13 07:48:34,137 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-10-13 07:48:34,137 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-13 07:48:34,137 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-10-13 07:48:34,137 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-13 07:48:34,138 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-13 07:48:34,138 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,138 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,138 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-13 07:48:34,138 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-13 07:48:34,138 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,139 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-10-13 07:48:34,139 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-13 07:48:34,139 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-13 07:48:34,139 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-13 07:48:34,139 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-10-13 07:48:34,139 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-10-13 07:48:34,140 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-13 07:48:34,140 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-10-13 07:48:34,140 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-10-13 07:48:34,140 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-10-13 07:48:34,140 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,140 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,141 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-10-13 07:48:34,141 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-10-13 07:48:34,141 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,141 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130REQUIRES_VIOLATION [2021-10-13 07:48:34,141 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-10-13 07:48:34,141 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-10-13 07:48:34,142 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-10-13 07:48:34,142 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:48:34,142 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:48:34,142 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:48:34,142 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:48:34,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 07:48:34,152 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:48:34,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:48:34 BoogieIcfgContainer [2021-10-13 07:48:34,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:48:34,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:48:34,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:48:34,203 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:48:34,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:48:19" (3/4) ... [2021-10-13 07:48:34,205 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 07:48:34,266 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:48:34,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:48:34,268 INFO L168 Benchmark]: Toolchain (without parser) took 17122.89 ms. Allocated memory was 100.7 MB in the beginning and 197.1 MB in the end (delta: 96.5 MB). Free memory was 65.8 MB in the beginning and 126.3 MB in the end (delta: -60.5 MB). Peak memory consumption was 35.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:34,268 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 100.7 MB. Free memory is still 55.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:48:34,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.12 ms. Allocated memory was 100.7 MB in the beginning and 130.0 MB in the end (delta: 29.4 MB). Free memory was 65.6 MB in the beginning and 96.0 MB in the end (delta: -30.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:34,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.44 ms. Allocated memory is still 130.0 MB. Free memory was 96.0 MB in the beginning and 92.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:34,270 INFO L168 Benchmark]: Boogie Preprocessor took 82.09 ms. Allocated memory is still 130.0 MB. Free memory was 92.8 MB in the beginning and 89.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:34,270 INFO L168 Benchmark]: RCFGBuilder took 1367.19 ms. Allocated memory is still 130.0 MB. Free memory was 89.8 MB in the beginning and 62.2 MB in the end (delta: 27.5 MB). Peak memory consumption was 29.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:34,271 INFO L168 Benchmark]: TraceAbstraction took 14914.77 ms. Allocated memory was 130.0 MB in the beginning and 197.1 MB in the end (delta: 67.1 MB). Free memory was 100.4 MB in the beginning and 131.5 MB in the end (delta: -31.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:34,271 INFO L168 Benchmark]: Witness Printer took 64.06 ms. Allocated memory is still 197.1 MB. Free memory was 131.5 MB in the beginning and 126.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:48:34,273 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.23 ms. Allocated memory is still 100.7 MB. Free memory is still 55.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 594.12 ms. Allocated memory was 100.7 MB in the beginning and 130.0 MB in the end (delta: 29.4 MB). Free memory was 65.6 MB in the beginning and 96.0 MB in the end (delta: -30.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.44 ms. Allocated memory is still 130.0 MB. Free memory was 96.0 MB in the beginning and 92.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 82.09 ms. Allocated memory is still 130.0 MB. Free memory was 92.8 MB in the beginning and 89.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1367.19 ms. Allocated memory is still 130.0 MB. Free memory was 89.8 MB in the beginning and 62.2 MB in the end (delta: 27.5 MB). Peak memory consumption was 29.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14914.77 ms. Allocated memory was 130.0 MB in the beginning and 197.1 MB in the end (delta: 67.1 MB). Free memory was 100.4 MB in the beginning and 131.5 MB in the end (delta: -31.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 16.1 GB. * Witness Printer took 64.06 ms. Allocated memory is still 197.1 MB. Free memory was 131.5 MB in the beginning and 126.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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; [L588] struct node *list = ((void *)0); [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) [L592] *pp2 = list [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) [L595] *pp1 = list [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; [L640] struct node *list = create_sll(&p1, &p2); [L642] \read(*p1) [L642] \read(*p2) [L626] COND FALSE !(!(beg)) [L627] COND FALSE !(!(end)) [L628] EXPR beg->next [L628] beg = beg->next [L628] COND TRUE end != beg [L629] COND TRUE !(beg) [L565] reach_error() - 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 14800.7ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 24.4ms, AutomataDifference: 10315.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3046 SDtfs, 5744 SDslu, 9413 SDs, 0 SdLazy, 7941 SolverSat, 532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5342.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 4544.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=0, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 193.0ms AutomataMinimizationTime, 18 MinimizatonAttempts, 769 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 82.2ms SsaConstructionTime, 642.4ms SatisfiabilityAnalysisTime, 3061.2ms InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 3934 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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-10-13 07:48:34,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c08dc3-7658-4e78-904f-fe7ec492612c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...