./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 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/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_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH --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 f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:21:16,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:21:16,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:21:16,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:21:16,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:21:16,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:21:16,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:21:16,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:21:16,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:21:16,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:21:16,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:21:16,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:21:16,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:21:16,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:21:16,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:21:16,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:21:16,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:21:16,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:21:16,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:21:16,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:21:16,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:21:16,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:21:16,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:21:16,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:21:16,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:21:16,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:21:16,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:21:16,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:21:16,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:21:16,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:21:16,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:21:16,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:21:16,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:21:16,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:21:16,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:21:16,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:21:16,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:21:16,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:21:16,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:21:16,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:21:16,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:21:16,994 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-03 05:21:17,032 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:21:17,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:21:17,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:21:17,041 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:21:17,041 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:21:17,042 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:21:17,042 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:21:17,042 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:21:17,042 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:21:17,042 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:21:17,043 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:21:17,044 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:21:17,044 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:21:17,044 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:21:17,044 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:21:17,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 05:21:17,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 05:21:17,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:21:17,046 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:21:17,046 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 05:21:17,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:21:17,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:21:17,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:21:17,047 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 05:21:17,047 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 05:21:17,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:21:17,049 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:21:17,049 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:21:17,049 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:21:17,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:21:17,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:21:17,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:21:17,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:21:17,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:21:17,051 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:21:17,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:21:17,051 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:21:17,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:21:17,052 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_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/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_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH 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 -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2021-11-03 05:21:17,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:21:17,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:21:17,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:21:17,369 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:21:17,370 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:21:17,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-11-03 05:21:17,434 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/data/b3ebd5eab/964a514b56544e66b82fde0608485eb2/FLAG6787c3fe4 [2021-11-03 05:21:17,966 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:21:17,967 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-11-03 05:21:17,991 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/data/b3ebd5eab/964a514b56544e66b82fde0608485eb2/FLAG6787c3fe4 [2021-11-03 05:21:18,281 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/data/b3ebd5eab/964a514b56544e66b82fde0608485eb2 [2021-11-03 05:21:18,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:21:18,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:21:18,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:21:18,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:21:18,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:21:18,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698c7999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18, skipping insertion in model container [2021-11-03 05:21:18,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:21:18,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:21:18,638 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_856e6a7d-5817-4496-ab31-9127a9dc56ce/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-11-03 05:21:18,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:21:18,673 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:21:18,707 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_856e6a7d-5817-4496-ab31-9127a9dc56ce/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-11-03 05:21:18,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:21:18,750 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:21:18,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18 WrapperNode [2021-11-03 05:21:18,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:21:18,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:21:18,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:21:18,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:21:18,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:21:18,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:21:18,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:21:18,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:21:18,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:21:18,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:21:18,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:21:18,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:21:18,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (1/1) ... [2021-11-03 05:21:18,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:21:18,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:21:18,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:21:18,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:21:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 05:21:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 05:21:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:21:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 05:21:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:21:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 05:21:18,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:21:18,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:21:18,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:21:20,402 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:21:20,403 INFO L299 CfgBuilder]: Removed 137 assume(true) statements. [2021-11-03 05:21:20,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:21:20 BoogieIcfgContainer [2021-11-03 05:21:20,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:21:20,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:21:20,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:21:20,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:21:20,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:21:18" (1/3) ... [2021-11-03 05:21:20,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abb708d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:21:20, skipping insertion in model container [2021-11-03 05:21:20,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:21:18" (2/3) ... [2021-11-03 05:21:20,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abb708d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:21:20, skipping insertion in model container [2021-11-03 05:21:20,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:21:20" (3/3) ... [2021-11-03 05:21:20,420 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2021-11-03 05:21:20,430 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:21:20,430 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2021-11-03 05:21:20,475 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:21:20,482 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:21:20,482 INFO L340 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2021-11-03 05:21:20,507 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-11-03 05:21:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-03 05:21:20,513 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:20,514 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-03 05:21:20,514 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-11-03 05:21:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash 883824, now seen corresponding path program 1 times [2021-11-03 05:21:20,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:20,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719810766] [2021-11-03 05:21:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:20,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:20,710 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:20,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719810766] [2021-11-03 05:21:20,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719810766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:20,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:20,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:21:20,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002106086] [2021-11-03 05:21:20,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:21:20,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:20,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:21:20,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:21:20,736 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-11-03 05:21:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:20,949 INFO L93 Difference]: Finished difference Result 278 states and 290 transitions. [2021-11-03 05:21:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:21:20,951 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-11-03 05:21:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:20,963 INFO L225 Difference]: With dead ends: 278 [2021-11-03 05:21:20,963 INFO L226 Difference]: Without dead ends: 277 [2021-11-03 05:21:20,964 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:21:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-03 05:21:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2021-11-03 05:21:21,013 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-11-03 05:21:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 288 transitions. [2021-11-03 05:21:21,018 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 288 transitions. Word has length 3 [2021-11-03 05:21:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:21,019 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 288 transitions. [2021-11-03 05:21:21,019 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-11-03 05:21:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 288 transitions. [2021-11-03 05:21:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-03 05:21:21,020 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:21,020 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-03 05:21:21,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:21:21,021 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-11-03 05:21:21,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:21,022 INFO L85 PathProgramCache]: Analyzing trace with hash 883825, now seen corresponding path program 1 times [2021-11-03 05:21:21,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:21,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26521992] [2021-11-03 05:21:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:21,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:21,082 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:21,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26521992] [2021-11-03 05:21:21,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26521992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:21,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:21,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:21:21,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080183490] [2021-11-03 05:21:21,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:21:21,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:21:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:21:21,086 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-11-03 05:21:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:21,280 INFO L93 Difference]: Finished difference Result 271 states and 283 transitions. [2021-11-03 05:21:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:21:21,281 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-11-03 05:21:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:21,287 INFO L225 Difference]: With dead ends: 271 [2021-11-03 05:21:21,288 INFO L226 Difference]: Without dead ends: 271 [2021-11-03 05:21:21,288 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:21:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-03 05:21:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2021-11-03 05:21:21,323 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-11-03 05:21:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 282 transitions. [2021-11-03 05:21:21,329 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 282 transitions. Word has length 3 [2021-11-03 05:21:21,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:21,330 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 282 transitions. [2021-11-03 05:21:21,330 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-11-03 05:21:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 282 transitions. [2021-11-03 05:21:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 05:21:21,331 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:21,332 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 05:21:21,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:21:21,334 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-11-03 05:21:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 849381547, now seen corresponding path program 1 times [2021-11-03 05:21:21,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:21,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724344040] [2021-11-03 05:21:21,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:21,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:21,534 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:21,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724344040] [2021-11-03 05:21:21,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724344040] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:21,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:21,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:21:21,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903567862] [2021-11-03 05:21:21,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:21:21,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:21,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:21:21,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:21:21,543 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-11-03 05:21:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:21,838 INFO L93 Difference]: Finished difference Result 262 states and 274 transitions. [2021-11-03 05:21:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:21:21,838 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-11-03 05:21:21,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:21,840 INFO L225 Difference]: With dead ends: 262 [2021-11-03 05:21:21,840 INFO L226 Difference]: Without dead ends: 262 [2021-11-03 05:21:21,841 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:21:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-03 05:21:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2021-11-03 05:21:21,859 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-11-03 05:21:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 273 transitions. [2021-11-03 05:21:21,861 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 273 transitions. Word has length 5 [2021-11-03 05:21:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:21,861 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 273 transitions. [2021-11-03 05:21:21,861 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-11-03 05:21:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 273 transitions. [2021-11-03 05:21:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 05:21:21,862 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:21,862 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 05:21:21,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 05:21:21,863 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-11-03 05:21:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash 849381548, now seen corresponding path program 1 times [2021-11-03 05:21:21,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:21,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407584105] [2021-11-03 05:21:21,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:21,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:21,954 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:21,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407584105] [2021-11-03 05:21:21,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407584105] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:21,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:21,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:21:21,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958123890] [2021-11-03 05:21:21,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:21:21,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:21,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:21:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:21:21,957 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-11-03 05:21:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:22,220 INFO L93 Difference]: Finished difference Result 253 states and 265 transitions. [2021-11-03 05:21:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:21:22,220 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-11-03 05:21:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:22,222 INFO L225 Difference]: With dead ends: 253 [2021-11-03 05:21:22,222 INFO L226 Difference]: Without dead ends: 253 [2021-11-03 05:21:22,222 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:21:22,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-11-03 05:21:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-11-03 05:21:22,226 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-11-03 05:21:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-11-03 05:21:22,228 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 5 [2021-11-03 05:21:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:22,228 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-11-03 05:21:22,228 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-11-03 05:21:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-11-03 05:21:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:21:22,229 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:22,229 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:21:22,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 05:21:22,230 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-11-03 05:21:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash 561024176, now seen corresponding path program 1 times [2021-11-03 05:21:22,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:22,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185285550] [2021-11-03 05:21:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:22,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:22,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:22,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185285550] [2021-11-03 05:21:22,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185285550] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:22,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:22,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:21:22,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452962001] [2021-11-03 05:21:22,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:21:22,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:22,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:21:22,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:21:22,277 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-11-03 05:21:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:22,480 INFO L93 Difference]: Finished difference Result 250 states and 262 transitions. [2021-11-03 05:21:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:21:22,481 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-11-03 05:21:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:22,482 INFO L225 Difference]: With dead ends: 250 [2021-11-03 05:21:22,483 INFO L226 Difference]: Without dead ends: 250 [2021-11-03 05:21:22,483 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:21:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-11-03 05:21:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2021-11-03 05:21:22,487 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-11-03 05:21:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 261 transitions. [2021-11-03 05:21:22,489 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 261 transitions. Word has length 6 [2021-11-03 05:21:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:22,489 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 261 transitions. [2021-11-03 05:21:22,489 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-11-03 05:21:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 261 transitions. [2021-11-03 05:21:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:21:22,490 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:22,490 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:21:22,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 05:21:22,491 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-11-03 05:21:22,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash 561024177, now seen corresponding path program 1 times [2021-11-03 05:21:22,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:22,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971753644] [2021-11-03 05:21:22,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:22,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:22,537 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:22,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971753644] [2021-11-03 05:21:22,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971753644] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:22,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:22,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:21:22,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970702827] [2021-11-03 05:21:22,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:21:22,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:22,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:21:22,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:21:22,540 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-11-03 05:21:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:22,703 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2021-11-03 05:21:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:21:22,704 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-11-03 05:21:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:22,705 INFO L225 Difference]: With dead ends: 247 [2021-11-03 05:21:22,705 INFO L226 Difference]: Without dead ends: 247 [2021-11-03 05:21:22,705 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:21:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-11-03 05:21:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2021-11-03 05:21:22,710 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-11-03 05:21:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 258 transitions. [2021-11-03 05:21:22,711 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 258 transitions. Word has length 6 [2021-11-03 05:21:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:22,711 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 258 transitions. [2021-11-03 05:21:22,712 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-11-03 05:21:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 258 transitions. [2021-11-03 05:21:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 05:21:22,712 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:22,713 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:21:22,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 05:21:22,713 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-11-03 05:21:22,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash -654503221, now seen corresponding path program 1 times [2021-11-03 05:21:22,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:22,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235210741] [2021-11-03 05:21:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:22,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:22,809 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:22,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235210741] [2021-11-03 05:21:22,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235210741] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:22,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:22,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:21:22,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819183830] [2021-11-03 05:21:22,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:21:22,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:22,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:21:22,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:21:22,812 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-11-03 05:21:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:23,092 INFO L93 Difference]: Finished difference Result 245 states and 257 transitions. [2021-11-03 05:21:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:21:23,092 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-11-03 05:21:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:23,093 INFO L225 Difference]: With dead ends: 245 [2021-11-03 05:21:23,094 INFO L226 Difference]: Without dead ends: 245 [2021-11-03 05:21:23,094 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:21:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-03 05:21:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-11-03 05:21:23,098 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-11-03 05:21:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 257 transitions. [2021-11-03 05:21:23,099 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 257 transitions. Word has length 10 [2021-11-03 05:21:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:23,100 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 257 transitions. [2021-11-03 05:21:23,100 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-11-03 05:21:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 257 transitions. [2021-11-03 05:21:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 05:21:23,101 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:23,101 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:21:23,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 05:21:23,102 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-11-03 05:21:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash -654503222, now seen corresponding path program 1 times [2021-11-03 05:21:23,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:23,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116872748] [2021-11-03 05:21:23,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:23,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:23,188 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:23,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116872748] [2021-11-03 05:21:23,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116872748] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:23,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:23,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:21:23,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345047079] [2021-11-03 05:21:23,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:21:23,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:21:23,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:21:23,191 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-11-03 05:21:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:23,359 INFO L93 Difference]: Finished difference Result 244 states and 256 transitions. [2021-11-03 05:21:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:21:23,359 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-11-03 05:21:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:23,360 INFO L225 Difference]: With dead ends: 244 [2021-11-03 05:21:23,361 INFO L226 Difference]: Without dead ends: 244 [2021-11-03 05:21:23,361 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:21:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-03 05:21:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-11-03 05:21:23,365 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-11-03 05:21:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 256 transitions. [2021-11-03 05:21:23,367 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 256 transitions. Word has length 10 [2021-11-03 05:21:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:23,367 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 256 transitions. [2021-11-03 05:21:23,367 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-11-03 05:21:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 256 transitions. [2021-11-03 05:21:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 05:21:23,368 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:23,368 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:21:23,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 05:21:23,369 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-11-03 05:21:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1226462896, now seen corresponding path program 1 times [2021-11-03 05:21:23,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:23,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689373878] [2021-11-03 05:21:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:23,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:23,485 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:23,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689373878] [2021-11-03 05:21:23,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689373878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:23,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:23,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:21:23,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648726300] [2021-11-03 05:21:23,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:21:23,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:23,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:21:23,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:21:23,488 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-11-03 05:21:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:23,733 INFO L93 Difference]: Finished difference Result 243 states and 255 transitions. [2021-11-03 05:21:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:21:23,734 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-11-03 05:21:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:23,736 INFO L225 Difference]: With dead ends: 243 [2021-11-03 05:21:23,736 INFO L226 Difference]: Without dead ends: 243 [2021-11-03 05:21:23,737 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:21:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-03 05:21:23,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-11-03 05:21:23,744 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-11-03 05:21:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 255 transitions. [2021-11-03 05:21:23,745 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 255 transitions. Word has length 14 [2021-11-03 05:21:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:23,746 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 255 transitions. [2021-11-03 05:21:23,746 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-11-03 05:21:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 255 transitions. [2021-11-03 05:21:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 05:21:23,747 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:23,747 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:21:23,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 05:21:23,748 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-11-03 05:21:23,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1226462897, now seen corresponding path program 1 times [2021-11-03 05:21:23,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:23,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882504144] [2021-11-03 05:21:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:23,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:23,877 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:23,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882504144] [2021-11-03 05:21:23,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882504144] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:23,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:23,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:21:23,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213133930] [2021-11-03 05:21:23,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:21:23,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:23,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:21:23,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:21:23,879 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-11-03 05:21:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:24,102 INFO L93 Difference]: Finished difference Result 242 states and 254 transitions. [2021-11-03 05:21:24,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:21:24,103 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-11-03 05:21:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:24,104 INFO L225 Difference]: With dead ends: 242 [2021-11-03 05:21:24,104 INFO L226 Difference]: Without dead ends: 242 [2021-11-03 05:21:24,105 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:21:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-03 05:21:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-11-03 05:21:24,109 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-11-03 05:21:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 254 transitions. [2021-11-03 05:21:24,111 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 254 transitions. Word has length 14 [2021-11-03 05:21:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:24,111 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 254 transitions. [2021-11-03 05:21:24,112 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-11-03 05:21:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 254 transitions. [2021-11-03 05:21:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-03 05:21:24,113 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:24,114 INFO L513 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-11-03 05:21:24,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 05:21:24,114 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-11-03 05:21:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 640226691, now seen corresponding path program 1 times [2021-11-03 05:21:24,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:24,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515916623] [2021-11-03 05:21:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:24,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:24,253 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:24,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515916623] [2021-11-03 05:21:24,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515916623] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:24,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:24,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:21:24,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394717432] [2021-11-03 05:21:24,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:21:24,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:24,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:21:24,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:21:24,257 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-11-03 05:21:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:24,471 INFO L93 Difference]: Finished difference Result 245 states and 258 transitions. [2021-11-03 05:21:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:21:24,471 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-11-03 05:21:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:24,473 INFO L225 Difference]: With dead ends: 245 [2021-11-03 05:21:24,473 INFO L226 Difference]: Without dead ends: 245 [2021-11-03 05:21:24,473 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:21:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-03 05:21:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 235. [2021-11-03 05:21:24,482 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-11-03 05:21:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 247 transitions. [2021-11-03 05:21:24,484 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 247 transitions. Word has length 24 [2021-11-03 05:21:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:24,485 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 247 transitions. [2021-11-03 05:21:24,485 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-11-03 05:21:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 247 transitions. [2021-11-03 05:21:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-03 05:21:24,486 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:24,486 INFO L513 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-11-03 05:21:24,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 05:21:24,486 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-11-03 05:21:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash 640226692, now seen corresponding path program 1 times [2021-11-03 05:21:24,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:24,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542829310] [2021-11-03 05:21:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:24,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:24,607 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:24,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542829310] [2021-11-03 05:21:24,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542829310] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:24,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:24,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:21:24,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818730694] [2021-11-03 05:21:24,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:21:24,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:24,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:21:24,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:21:24,609 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-11-03 05:21:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:24,835 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2021-11-03 05:21:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:21:24,836 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-11-03 05:21:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:24,837 INFO L225 Difference]: With dead ends: 238 [2021-11-03 05:21:24,837 INFO L226 Difference]: Without dead ends: 238 [2021-11-03 05:21:24,838 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:21:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-03 05:21:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 228. [2021-11-03 05:21:24,842 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-11-03 05:21:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 240 transitions. [2021-11-03 05:21:24,843 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 240 transitions. Word has length 24 [2021-11-03 05:21:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:24,843 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 240 transitions. [2021-11-03 05:21:24,843 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-11-03 05:21:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 240 transitions. [2021-11-03 05:21:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 05:21:24,844 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:24,844 INFO L513 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-11-03 05:21:24,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 05:21:24,844 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-11-03 05:21:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:24,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1627808933, now seen corresponding path program 1 times [2021-11-03 05:21:24,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:24,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162703736] [2021-11-03 05:21:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:24,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:24,926 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:24,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162703736] [2021-11-03 05:21:24,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162703736] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:24,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:24,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:21:24,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809881594] [2021-11-03 05:21:24,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:21:24,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:24,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:21:24,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:21:24,928 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-11-03 05:21:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:25,137 INFO L93 Difference]: Finished difference Result 231 states and 244 transitions. [2021-11-03 05:21:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:21:25,138 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-11-03 05:21:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:25,140 INFO L225 Difference]: With dead ends: 231 [2021-11-03 05:21:25,140 INFO L226 Difference]: Without dead ends: 231 [2021-11-03 05:21:25,140 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:21:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-11-03 05:21:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2021-11-03 05:21:25,144 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-11-03 05:21:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 233 transitions. [2021-11-03 05:21:25,146 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 233 transitions. Word has length 25 [2021-11-03 05:21:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:25,146 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 233 transitions. [2021-11-03 05:21:25,146 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-11-03 05:21:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 233 transitions. [2021-11-03 05:21:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 05:21:25,147 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:25,147 INFO L513 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-11-03 05:21:25,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 05:21:25,148 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-11-03 05:21:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1627808932, now seen corresponding path program 1 times [2021-11-03 05:21:25,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:25,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470916628] [2021-11-03 05:21:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:25,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:25,266 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:25,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470916628] [2021-11-03 05:21:25,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470916628] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:25,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:25,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:21:25,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852765092] [2021-11-03 05:21:25,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:21:25,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:25,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:21:25,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:21:25,268 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-11-03 05:21:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:25,445 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2021-11-03 05:21:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:21:25,445 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-11-03 05:21:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:25,447 INFO L225 Difference]: With dead ends: 224 [2021-11-03 05:21:25,447 INFO L226 Difference]: Without dead ends: 224 [2021-11-03 05:21:25,447 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:21:25,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-03 05:21:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2021-11-03 05:21:25,451 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-11-03 05:21:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 226 transitions. [2021-11-03 05:21:25,452 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 226 transitions. Word has length 25 [2021-11-03 05:21:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:25,452 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 226 transitions. [2021-11-03 05:21:25,452 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-11-03 05:21:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 226 transitions. [2021-11-03 05:21:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-03 05:21:25,453 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:25,454 INFO L513 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-11-03 05:21:25,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 05:21:25,455 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-11-03 05:21:25,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:25,455 INFO L85 PathProgramCache]: Analyzing trace with hash -955589745, now seen corresponding path program 1 times [2021-11-03 05:21:25,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:25,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71240588] [2021-11-03 05:21:25,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:25,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:26,100 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:26,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71240588] [2021-11-03 05:21:26,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71240588] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:26,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:26,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-03 05:21:26,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976006739] [2021-11-03 05:21:26,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-03 05:21:26,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-03 05:21:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:21:26,102 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-11-03 05:21:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:27,737 INFO L93 Difference]: Finished difference Result 406 states and 429 transitions. [2021-11-03 05:21:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:21:27,738 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-11-03 05:21:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:27,740 INFO L225 Difference]: With dead ends: 406 [2021-11-03 05:21:27,740 INFO L226 Difference]: Without dead ends: 406 [2021-11-03 05:21:27,741 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2021-11-03 05:21:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-03 05:21:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 226. [2021-11-03 05:21:27,747 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-11-03 05:21:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 239 transitions. [2021-11-03 05:21:27,748 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 239 transitions. Word has length 27 [2021-11-03 05:21:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:27,748 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 239 transitions. [2021-11-03 05:21:27,749 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-11-03 05:21:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 239 transitions. [2021-11-03 05:21:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-03 05:21:27,750 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:27,750 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:21:27,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 05:21:27,751 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-11-03 05:21:27,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:27,751 INFO L85 PathProgramCache]: Analyzing trace with hash 801448723, now seen corresponding path program 1 times [2021-11-03 05:21:27,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:27,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063348998] [2021-11-03 05:21:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:27,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:28,121 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:28,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063348998] [2021-11-03 05:21:28,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063348998] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:28,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:28,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-03 05:21:28,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653790557] [2021-11-03 05:21:28,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-03 05:21:28,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:28,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-03 05:21:28,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:21:28,128 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-11-03 05:21:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:29,572 INFO L93 Difference]: Finished difference Result 488 states and 518 transitions. [2021-11-03 05:21:29,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-03 05:21:29,573 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-11-03 05:21:29,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:29,575 INFO L225 Difference]: With dead ends: 488 [2021-11-03 05:21:29,575 INFO L226 Difference]: Without dead ends: 488 [2021-11-03 05:21:29,576 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2021-11-03 05:21:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-11-03 05:21:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 268. [2021-11-03 05:21:29,582 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-11-03 05:21:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 299 transitions. [2021-11-03 05:21:29,584 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 299 transitions. Word has length 29 [2021-11-03 05:21:29,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:29,584 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 299 transitions. [2021-11-03 05:21:29,584 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-11-03 05:21:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 299 transitions. [2021-11-03 05:21:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-03 05:21:29,586 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:29,586 INFO L513 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-11-03 05:21:29,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 05:21:29,586 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-11-03 05:21:29,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash -924887149, now seen corresponding path program 1 times [2021-11-03 05:21:29,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:29,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304434129] [2021-11-03 05:21:29,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:29,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:30,192 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:30,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304434129] [2021-11-03 05:21:30,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304434129] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:30,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:30,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-03 05:21:30,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904236854] [2021-11-03 05:21:30,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-03 05:21:30,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:30,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-03 05:21:30,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:21:30,194 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-11-03 05:21:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:31,891 INFO L93 Difference]: Finished difference Result 416 states and 455 transitions. [2021-11-03 05:21:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:21:31,891 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-11-03 05:21:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:31,894 INFO L225 Difference]: With dead ends: 416 [2021-11-03 05:21:31,894 INFO L226 Difference]: Without dead ends: 416 [2021-11-03 05:21:31,895 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2021-11-03 05:21:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-11-03 05:21:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 267. [2021-11-03 05:21:31,902 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-11-03 05:21:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2021-11-03 05:21:31,904 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 30 [2021-11-03 05:21:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:31,904 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2021-11-03 05:21:31,905 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-11-03 05:21:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2021-11-03 05:21:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-03 05:21:31,906 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:31,906 INFO L513 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-11-03 05:21:31,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 05:21:31,906 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-11-03 05:21:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:31,907 INFO L85 PathProgramCache]: Analyzing trace with hash -924887148, now seen corresponding path program 1 times [2021-11-03 05:21:31,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:31,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826176436] [2021-11-03 05:21:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:31,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:21:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:21:32,546 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:21:32,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826176436] [2021-11-03 05:21:32,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826176436] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:21:32,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:21:32,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-03 05:21:32,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465630965] [2021-11-03 05:21:32,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-03 05:21:32,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:32,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-03 05:21:32,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:21:32,550 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-11-03 05:21:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:34,686 INFO L93 Difference]: Finished difference Result 445 states and 484 transitions. [2021-11-03 05:21:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:21:34,687 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-11-03 05:21:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:34,689 INFO L225 Difference]: With dead ends: 445 [2021-11-03 05:21:34,689 INFO L226 Difference]: Without dead ends: 445 [2021-11-03 05:21:34,690 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2021-11-03 05:21:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-03 05:21:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 271. [2021-11-03 05:21:34,696 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-11-03 05:21:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 301 transitions. [2021-11-03 05:21:34,697 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 301 transitions. Word has length 30 [2021-11-03 05:21:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:34,698 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 301 transitions. [2021-11-03 05:21:34,698 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-11-03 05:21:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 301 transitions. [2021-11-03 05:21:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-03 05:21:34,699 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:21:34,699 INFO L513 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-11-03 05:21:34,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-03 05:21:34,699 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-11-03 05:21:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:21:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1077683325, now seen corresponding path program 1 times [2021-11-03 05:21:34,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:21:34,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942181085] [2021-11-03 05:21:34,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:21:34,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:21:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 05:21:34,747 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 05:21:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 05:21:34,836 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 05:21:34,836 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 05:21:34,837 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-03 05:21:34,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-03 05:21:34,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-03 05:21:34,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-03 05:21:34,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-03 05:21:34,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-03 05:21:34,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-03 05:21:34,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-03 05:21:34,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-03 05:21:34,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-03 05:21:34,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-03 05:21:34,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-03 05:21:34,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-03 05:21:34,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-03 05:21:34,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-03 05:21:34,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-03 05:21:34,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-03 05:21:34,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-03 05:21:34,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-03 05:21:34,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-03 05:21:34,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-03 05:21:34,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-03 05:21:34,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-03 05:21:34,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-03 05:21:34,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-03 05:21:34,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-03 05:21:34,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-03 05:21:34,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-03 05:21:34,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-03 05:21:34,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-03 05:21:34,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-03 05:21:34,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-03 05:21:34,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-11-03 05:21:34,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-03 05:21:34,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-03 05:21:34,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-11-03 05:21:34,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-03 05:21:34,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-03 05:21:34,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-03 05:21:34,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-03 05:21:34,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-03 05:21:34,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-03 05:21:34,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-03 05:21:34,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-03 05:21:34,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-03 05:21:34,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-03 05:21:34,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-03 05:21:34,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-11-03 05:21:34,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-11-03 05:21:34,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-11-03 05:21:34,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-11-03 05:21:34,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-03 05:21:34,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-11-03 05:21:34,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-11-03 05:21:34,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-11-03 05:21:34,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-11-03 05:21:34,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-11-03 05:21:34,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-11-03 05:21:34,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-11-03 05:21:34,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-11-03 05:21:34,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-11-03 05:21:34,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-11-03 05:21:34,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-11-03 05:21:34,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-11-03 05:21:34,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-11-03 05:21:34,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-11-03 05:21:34,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-11-03 05:21:34,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-11-03 05:21:34,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-11-03 05:21:34,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-11-03 05:21:34,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-11-03 05:21:34,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-11-03 05:21:34,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-11-03 05:21:34,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-11-03 05:21:34,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-11-03 05:21:34,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-11-03 05:21:34,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-11-03 05:21:34,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-11-03 05:21:34,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-11-03 05:21:34,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-11-03 05:21:34,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-11-03 05:21:34,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-11-03 05:21:34,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-11-03 05:21:34,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-11-03 05:21:34,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-11-03 05:21:34,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-11-03 05:21:34,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-11-03 05:21:34,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-11-03 05:21:34,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-11-03 05:21:34,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-11-03 05:21:34,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-11-03 05:21:34,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-11-03 05:21:34,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-11-03 05:21:34,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-11-03 05:21:34,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-11-03 05:21:34,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-11-03 05:21:34,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-11-03 05:21:34,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-11-03 05:21:34,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-11-03 05:21:34,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-11-03 05:21:34,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-11-03 05:21:34,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-11-03 05:21:34,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-11-03 05:21:34,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-11-03 05:21:34,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-11-03 05:21:34,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-11-03 05:21:34,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-11-03 05:21:34,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-11-03 05:21:34,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-11-03 05:21:34,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-11-03 05:21:34,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130REQUIRES_VIOLATION [2021-11-03 05:21:34,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-11-03 05:21:34,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-11-03 05:21:34,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-11-03 05:21:34,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:21:34,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:21:34,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:21:34,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:34,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-03 05:21:34,867 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:21:34,872 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 05:21:34,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 05:21:34 BoogieIcfgContainer [2021-11-03 05:21:34,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 05:21:34,917 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 05:21:34,917 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 05:21:34,917 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 05:21:34,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:21:20" (3/4) ... [2021-11-03 05:21:34,919 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-03 05:21:34,963 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 05:21:34,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 05:21:34,965 INFO L168 Benchmark]: Toolchain (without parser) took 16679.22 ms. Allocated memory was 121.6 MB in the beginning and 232.8 MB in the end (delta: 111.1 MB). Free memory was 79.1 MB in the beginning and 175.7 MB in the end (delta: -96.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:34,965 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 121.6 MB. Free memory is still 97.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:21:34,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.87 ms. Allocated memory is still 121.6 MB. Free memory was 78.9 MB in the beginning and 87.9 MB in the end (delta: -9.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:34,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.77 ms. Allocated memory is still 121.6 MB. Free memory was 87.9 MB in the beginning and 84.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:34,967 INFO L168 Benchmark]: Boogie Preprocessor took 51.79 ms. Allocated memory is still 121.6 MB. Free memory was 84.5 MB in the beginning and 81.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:34,967 INFO L168 Benchmark]: RCFGBuilder took 1528.37 ms. Allocated memory was 121.6 MB in the beginning and 159.4 MB in the end (delta: 37.7 MB). Free memory was 81.4 MB in the beginning and 109.7 MB in the end (delta: -28.3 MB). Peak memory consumption was 49.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:34,968 INFO L168 Benchmark]: TraceAbstraction took 14505.69 ms. Allocated memory was 159.4 MB in the beginning and 232.8 MB in the end (delta: 73.4 MB). Free memory was 109.7 MB in the beginning and 180.9 MB in the end (delta: -71.3 MB). Peak memory consumption was 118.2 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:34,968 INFO L168 Benchmark]: Witness Printer took 46.98 ms. Allocated memory is still 232.8 MB. Free memory was 180.9 MB in the beginning and 175.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:34,970 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.47 ms. Allocated memory is still 121.6 MB. Free memory is still 97.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 463.87 ms. Allocated memory is still 121.6 MB. Free memory was 78.9 MB in the beginning and 87.9 MB in the end (delta: -9.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.77 ms. Allocated memory is still 121.6 MB. Free memory was 87.9 MB in the beginning and 84.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.79 ms. Allocated memory is still 121.6 MB. Free memory was 84.5 MB in the beginning and 81.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1528.37 ms. Allocated memory was 121.6 MB in the beginning and 159.4 MB in the end (delta: 37.7 MB). Free memory was 81.4 MB in the beginning and 109.7 MB in the end (delta: -28.3 MB). Peak memory consumption was 49.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14505.69 ms. Allocated memory was 159.4 MB in the beginning and 232.8 MB in the end (delta: 73.4 MB). Free memory was 109.7 MB in the beginning and 180.9 MB in the end (delta: -71.3 MB). Peak memory consumption was 118.2 MB. Max. memory is 16.1 GB. * Witness Printer took 46.98 ms. Allocated memory is still 232.8 MB. Free memory was 180.9 MB in the beginning and 175.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L639] const struct node *p1, *p2; [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: 14.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3046 SDtfs, 5744 SDslu, 9413 SDs, 0 SdLazy, 7941 SolverSat, 532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 4.4s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 769 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s 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-11-03 05:21:35,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_856e6a7d-5817-4496-ab31-9127a9dc56ce/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)