./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f97ce2884dfc15b6dcac26e010448359c46506d8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:55:29,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:55:29,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:55:29,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:55:29,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:55:29,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:55:29,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:55:29,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:55:29,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:55:29,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:55:29,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:55:29,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:55:29,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:55:29,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:55:29,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:55:29,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:55:29,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:55:29,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:55:29,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:55:29,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:55:29,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:55:29,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:55:29,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:55:29,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:55:29,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:55:29,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:55:29,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:55:29,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:55:29,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:55:29,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:55:29,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:55:29,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:55:29,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:55:29,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:55:29,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:55:29,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:55:29,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:55:29,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:55:29,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:55:29,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:55:29,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:55:29,801 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-13 07:55:29,843 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:55:29,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:55:29,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:55:29,844 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:55:29,845 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:55:29,845 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:55:29,845 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:55:29,845 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:55:29,845 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:55:29,846 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:55:29,846 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:55:29,846 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:55:29,846 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:55:29,846 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:55:29,847 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:55:29,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 07:55:29,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 07:55:29,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:55:29,848 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:55:29,848 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 07:55:29,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:55:29,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:55:29,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:55:29,849 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 07:55:29,849 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 07:55:29,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:55:29,849 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:55:29,849 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:55:29,849 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:55:29,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:55:29,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:55:29,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:55:29,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:55:29,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:55:29,850 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:55:29,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:55:29,850 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:55:29,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:55:29,851 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_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f97ce2884dfc15b6dcac26e010448359c46506d8 [2021-10-13 07:55:30,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:55:30,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:55:30,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:55:30,149 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:55:30,150 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:55:30,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2021-10-13 07:55:30,226 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/data/d62878515/ad5c574c41104ab08e14d7c330e27710/FLAG3a76a140f [2021-10-13 07:55:30,724 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:55:30,724 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2021-10-13 07:55:30,741 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/data/d62878515/ad5c574c41104ab08e14d7c330e27710/FLAG3a76a140f [2021-10-13 07:55:31,046 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/data/d62878515/ad5c574c41104ab08e14d7c330e27710 [2021-10-13 07:55:31,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:55:31,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:55:31,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:55:31,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:55:31,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:55:31,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260aa32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31, skipping insertion in model container [2021-10-13 07:55:31,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:55:31,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:55:31,458 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_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2021-10-13 07:55:31,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:55:31,505 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:55:31,533 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_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2021-10-13 07:55:31,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:55:31,585 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:55:31,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31 WrapperNode [2021-10-13 07:55:31,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:55:31,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:55:31,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:55:31,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:55:31,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:55:31,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:55:31,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:55:31,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:55:31,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:55:31,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:55:31,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:55:31,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:55:31,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (1/1) ... [2021-10-13 07:55:31,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:55:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:55:31,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:55:31,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:55:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 07:55:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2021-10-13 07:55:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2021-10-13 07:55:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 07:55:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:55:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-10-13 07:55:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-10-13 07:55:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 07:55:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 07:55:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-13 07:55:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2021-10-13 07:55:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2021-10-13 07:55:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2021-10-13 07:55:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2021-10-13 07:55:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:55:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:55:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:55:33,117 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:55:33,118 INFO L299 CfgBuilder]: Removed 148 assume(true) statements. [2021-10-13 07:55:33,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:55:33 BoogieIcfgContainer [2021-10-13 07:55:33,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:55:33,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:55:33,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:55:33,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:55:33,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:55:31" (1/3) ... [2021-10-13 07:55:33,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd4d2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:55:33, skipping insertion in model container [2021-10-13 07:55:33,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:55:31" (2/3) ... [2021-10-13 07:55:33,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd4d2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:55:33, skipping insertion in model container [2021-10-13 07:55:33,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:55:33" (3/3) ... [2021-10-13 07:55:33,131 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2021-10-13 07:55:33,137 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:55:33,137 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 159 error locations. [2021-10-13 07:55:33,193 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:55:33,202 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:55:33,203 INFO L340 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2021-10-13 07:55:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 171 states have (on average 2.47953216374269) internal successors, (424), 332 states have internal predecessors, (424), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 07:55:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 07:55:33,248 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:33,248 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:33,249 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:33,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:33,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1934548942, now seen corresponding path program 1 times [2021-10-13 07:55:33,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:33,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162037778] [2021-10-13 07:55:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:33,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:55:33,430 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:33,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162037778] [2021-10-13 07:55:33,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162037778] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:33,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:33,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:55:33,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701691579] [2021-10-13 07:55:33,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:55:33,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:33,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:55:33,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:55:33,474 INFO L87 Difference]: Start difference. First operand has 342 states, 171 states have (on average 2.47953216374269) internal successors, (424), 332 states have internal predecessors, (424), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:33,744 INFO L93 Difference]: Finished difference Result 342 states and 361 transitions. [2021-10-13 07:55:33,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:55:33,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 07:55:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:33,766 INFO L225 Difference]: With dead ends: 342 [2021-10-13 07:55:33,767 INFO L226 Difference]: Without dead ends: 341 [2021-10-13 07:55:33,768 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:55:33,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-10-13 07:55:33,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2021-10-13 07:55:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 171 states have (on average 2.0) internal successors, (342), 329 states have internal predecessors, (342), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 07:55:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 356 transitions. [2021-10-13 07:55:33,845 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 356 transitions. Word has length 7 [2021-10-13 07:55:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:33,845 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 356 transitions. [2021-10-13 07:55:33,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 356 transitions. [2021-10-13 07:55:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 07:55:33,846 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:33,846 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:33,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:55:33,847 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1934548943, now seen corresponding path program 1 times [2021-10-13 07:55:33,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:33,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980398068] [2021-10-13 07:55:33,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:33,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:55:33,954 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:33,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980398068] [2021-10-13 07:55:33,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980398068] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:33,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:33,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:55:33,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115743063] [2021-10-13 07:55:33,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:55:33,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:33,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:55:33,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:55:33,957 INFO L87 Difference]: Start difference. First operand 339 states and 356 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:34,148 INFO L93 Difference]: Finished difference Result 339 states and 358 transitions. [2021-10-13 07:55:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:55:34,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 07:55:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:34,152 INFO L225 Difference]: With dead ends: 339 [2021-10-13 07:55:34,153 INFO L226 Difference]: Without dead ends: 339 [2021-10-13 07:55:34,153 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:55:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-10-13 07:55:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2021-10-13 07:55:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 171 states have (on average 1.9883040935672514) internal successors, (340), 327 states have internal predecessors, (340), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 07:55:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 354 transitions. [2021-10-13 07:55:34,186 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 354 transitions. Word has length 7 [2021-10-13 07:55:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:34,189 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 354 transitions. [2021-10-13 07:55:34,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 354 transitions. [2021-10-13 07:55:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:55:34,191 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:34,191 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:34,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:55:34,192 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting dll_insert_masterErr0REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:34,198 INFO L82 PathProgramCache]: Analyzing trace with hash -647647508, now seen corresponding path program 1 times [2021-10-13 07:55:34,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:34,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205856008] [2021-10-13 07:55:34,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:34,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:55:34,279 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:34,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205856008] [2021-10-13 07:55:34,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205856008] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:34,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:34,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:55:34,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260489239] [2021-10-13 07:55:34,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:55:34,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:34,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:55:34,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:55:34,283 INFO L87 Difference]: Start difference. First operand 337 states and 354 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:34,459 INFO L93 Difference]: Finished difference Result 334 states and 351 transitions. [2021-10-13 07:55:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:55:34,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 07:55:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:34,463 INFO L225 Difference]: With dead ends: 334 [2021-10-13 07:55:34,463 INFO L226 Difference]: Without dead ends: 334 [2021-10-13 07:55:34,463 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:55:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-10-13 07:55:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2021-10-13 07:55:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 171 states have (on average 1.9707602339181287) internal successors, (337), 324 states have internal predecessors, (337), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 07:55:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 351 transitions. [2021-10-13 07:55:34,475 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 351 transitions. Word has length 9 [2021-10-13 07:55:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:34,476 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 351 transitions. [2021-10-13 07:55:34,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 351 transitions. [2021-10-13 07:55:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:55:34,477 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:34,477 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:34,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:55:34,478 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting dll_insert_masterErr1REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:34,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:34,479 INFO L82 PathProgramCache]: Analyzing trace with hash -647647507, now seen corresponding path program 1 times [2021-10-13 07:55:34,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:34,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253475016] [2021-10-13 07:55:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:34,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:55:34,574 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:34,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253475016] [2021-10-13 07:55:34,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253475016] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:34,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:34,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:55:34,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881105885] [2021-10-13 07:55:34,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:55:34,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:55:34,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:55:34,578 INFO L87 Difference]: Start difference. First operand 334 states and 351 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:34,760 INFO L93 Difference]: Finished difference Result 331 states and 348 transitions. [2021-10-13 07:55:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:55:34,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 07:55:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:34,763 INFO L225 Difference]: With dead ends: 331 [2021-10-13 07:55:34,763 INFO L226 Difference]: Without dead ends: 331 [2021-10-13 07:55:34,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:55:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-10-13 07:55:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2021-10-13 07:55:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 171 states have (on average 1.9532163742690059) internal successors, (334), 321 states have internal predecessors, (334), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 07:55:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 348 transitions. [2021-10-13 07:55:34,772 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 348 transitions. Word has length 9 [2021-10-13 07:55:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:34,772 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 348 transitions. [2021-10-13 07:55:34,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 348 transitions. [2021-10-13 07:55:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:55:34,773 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:34,773 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:34,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:55:34,774 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:34,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:34,774 INFO L82 PathProgramCache]: Analyzing trace with hash -619277081, now seen corresponding path program 1 times [2021-10-13 07:55:34,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:34,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131090181] [2021-10-13 07:55:34,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:34,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:55:34,871 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:34,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131090181] [2021-10-13 07:55:34,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131090181] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:34,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:34,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:55:34,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372994769] [2021-10-13 07:55:34,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:55:34,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:34,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:55:34,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:55:34,874 INFO L87 Difference]: Start difference. First operand 331 states and 348 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:34,952 INFO L93 Difference]: Finished difference Result 353 states and 378 transitions. [2021-10-13 07:55:34,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:55:34,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 07:55:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:34,955 INFO L225 Difference]: With dead ends: 353 [2021-10-13 07:55:34,955 INFO L226 Difference]: Without dead ends: 353 [2021-10-13 07:55:34,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:55:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-10-13 07:55:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 347. [2021-10-13 07:55:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 180 states have (on average 1.9277777777777778) internal successors, (347), 330 states have internal predecessors, (347), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (15), 10 states have call predecessors, (15), 12 states have call successors, (15) [2021-10-13 07:55:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 374 transitions. [2021-10-13 07:55:34,966 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 374 transitions. Word has length 9 [2021-10-13 07:55:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:34,967 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 374 transitions. [2021-10-13 07:55:34,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 374 transitions. [2021-10-13 07:55:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 07:55:34,968 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:34,968 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:34,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:55:34,968 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting dll_insert_masterErr6REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:34,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1073762538, now seen corresponding path program 1 times [2021-10-13 07:55:34,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:34,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859627760] [2021-10-13 07:55:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:34,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:55:35,093 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:35,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859627760] [2021-10-13 07:55:35,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859627760] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:35,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:35,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 07:55:35,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235512640] [2021-10-13 07:55:35,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:55:35,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:55:35,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:55:35,096 INFO L87 Difference]: Start difference. First operand 347 states and 374 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:35,640 INFO L93 Difference]: Finished difference Result 366 states and 396 transitions. [2021-10-13 07:55:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:55:35,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 07:55:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:35,643 INFO L225 Difference]: With dead ends: 366 [2021-10-13 07:55:35,644 INFO L226 Difference]: Without dead ends: 366 [2021-10-13 07:55:35,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-13 07:55:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-13 07:55:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 356. [2021-10-13 07:55:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 188 states have (on average 1.898936170212766) internal successors, (357), 337 states have internal predecessors, (357), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-13 07:55:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 386 transitions. [2021-10-13 07:55:35,656 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 386 transitions. Word has length 12 [2021-10-13 07:55:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:35,656 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 386 transitions. [2021-10-13 07:55:35,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 386 transitions. [2021-10-13 07:55:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 07:55:35,658 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:35,658 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:35,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:55:35,658 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting dll_insert_masterErr7REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:35,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1073762537, now seen corresponding path program 1 times [2021-10-13 07:55:35,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:35,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868929208] [2021-10-13 07:55:35,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:35,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:55:35,773 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:35,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868929208] [2021-10-13 07:55:35,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868929208] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:35,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:35,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:55:35,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052586533] [2021-10-13 07:55:35,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:55:35,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:55:35,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:55:35,776 INFO L87 Difference]: Start difference. First operand 356 states and 386 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:36,440 INFO L93 Difference]: Finished difference Result 364 states and 394 transitions. [2021-10-13 07:55:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:55:36,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 07:55:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:36,443 INFO L225 Difference]: With dead ends: 364 [2021-10-13 07:55:36,443 INFO L226 Difference]: Without dead ends: 364 [2021-10-13 07:55:36,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 57.9ms TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:55:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-13 07:55:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 356. [2021-10-13 07:55:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 188 states have (on average 1.8882978723404256) internal successors, (355), 337 states have internal predecessors, (355), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-13 07:55:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 384 transitions. [2021-10-13 07:55:36,455 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 384 transitions. Word has length 12 [2021-10-13 07:55:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:36,455 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 384 transitions. [2021-10-13 07:55:36,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 384 transitions. [2021-10-13 07:55:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 07:55:36,456 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:36,456 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:36,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:55:36,457 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting dll_insert_masterErr8REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1073127878, now seen corresponding path program 1 times [2021-10-13 07:55:36,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:36,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762826746] [2021-10-13 07:55:36,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:36,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:55:36,489 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:36,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762826746] [2021-10-13 07:55:36,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762826746] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:36,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:36,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:55:36,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678127519] [2021-10-13 07:55:36,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:55:36,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:36,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:55:36,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:55:36,492 INFO L87 Difference]: Start difference. First operand 356 states and 384 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:36,708 INFO L93 Difference]: Finished difference Result 355 states and 383 transitions. [2021-10-13 07:55:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:55:36,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 07:55:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:36,711 INFO L225 Difference]: With dead ends: 355 [2021-10-13 07:55:36,711 INFO L226 Difference]: Without dead ends: 355 [2021-10-13 07:55:36,711 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:55:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-10-13 07:55:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2021-10-13 07:55:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 188 states have (on average 1.8829787234042554) internal successors, (354), 336 states have internal predecessors, (354), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-13 07:55:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 383 transitions. [2021-10-13 07:55:36,721 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 383 transitions. Word has length 13 [2021-10-13 07:55:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:36,722 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 383 transitions. [2021-10-13 07:55:36,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 383 transitions. [2021-10-13 07:55:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 07:55:36,723 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:36,723 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:36,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:55:36,723 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting dll_insert_masterErr9REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1073127879, now seen corresponding path program 1 times [2021-10-13 07:55:36,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:36,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917256622] [2021-10-13 07:55:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:36,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:55:36,764 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:36,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917256622] [2021-10-13 07:55:36,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917256622] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:36,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:36,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:55:36,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425420845] [2021-10-13 07:55:36,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:55:36,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:36,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:55:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:55:36,766 INFO L87 Difference]: Start difference. First operand 355 states and 383 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:36,923 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2021-10-13 07:55:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:55:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 07:55:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:36,926 INFO L225 Difference]: With dead ends: 354 [2021-10-13 07:55:36,926 INFO L226 Difference]: Without dead ends: 354 [2021-10-13 07:55:36,927 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:55:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-10-13 07:55:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2021-10-13 07:55:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 188 states have (on average 1.877659574468085) internal successors, (353), 335 states have internal predecessors, (353), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-13 07:55:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 382 transitions. [2021-10-13 07:55:36,937 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 382 transitions. Word has length 13 [2021-10-13 07:55:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:36,937 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 382 transitions. [2021-10-13 07:55:36,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 382 transitions. [2021-10-13 07:55:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 07:55:36,938 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:36,938 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:36,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:55:36,939 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting dll_insert_masterErr10REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:36,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:36,939 INFO L82 PathProgramCache]: Analyzing trace with hash 483741159, now seen corresponding path program 1 times [2021-10-13 07:55:36,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:36,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820043721] [2021-10-13 07:55:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:36,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:55:37,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:37,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820043721] [2021-10-13 07:55:37,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820043721] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:37,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:37,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 07:55:37,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116820250] [2021-10-13 07:55:37,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 07:55:37,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:37,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 07:55:37,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-13 07:55:37,136 INFO L87 Difference]: Start difference. First operand 354 states and 382 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:37,757 INFO L93 Difference]: Finished difference Result 381 states and 414 transitions. [2021-10-13 07:55:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 07:55:37,758 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-13 07:55:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:37,760 INFO L225 Difference]: With dead ends: 381 [2021-10-13 07:55:37,760 INFO L226 Difference]: Without dead ends: 381 [2021-10-13 07:55:37,761 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 137.0ms TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-10-13 07:55:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-13 07:55:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 368. [2021-10-13 07:55:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 199 states have (on average 1.8542713567839195) internal successors, (369), 346 states have internal predecessors, (369), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-13 07:55:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 404 transitions. [2021-10-13 07:55:37,771 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 404 transitions. Word has length 15 [2021-10-13 07:55:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:37,772 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 404 transitions. [2021-10-13 07:55:37,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 404 transitions. [2021-10-13 07:55:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:55:37,773 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:37,773 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:37,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:55:37,773 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:37,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1544475002, now seen corresponding path program 1 times [2021-10-13 07:55:37,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:37,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609672892] [2021-10-13 07:55:37,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:37,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 07:55:37,865 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:37,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609672892] [2021-10-13 07:55:37,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609672892] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:37,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:37,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:55:37,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571262546] [2021-10-13 07:55:37,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:55:37,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:37,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:55:37,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:55:37,867 INFO L87 Difference]: Start difference. First operand 368 states and 404 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:38,271 INFO L93 Difference]: Finished difference Result 366 states and 402 transitions. [2021-10-13 07:55:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:55:38,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 07:55:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:38,275 INFO L225 Difference]: With dead ends: 366 [2021-10-13 07:55:38,275 INFO L226 Difference]: Without dead ends: 366 [2021-10-13 07:55:38,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 30.3ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:55:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-13 07:55:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-10-13 07:55:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 199 states have (on average 1.8442211055276383) internal successors, (367), 344 states have internal predecessors, (367), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-13 07:55:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 402 transitions. [2021-10-13 07:55:38,285 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 402 transitions. Word has length 23 [2021-10-13 07:55:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:38,286 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 402 transitions. [2021-10-13 07:55:38,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 402 transitions. [2021-10-13 07:55:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:55:38,287 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:38,287 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:38,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:55:38,287 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:38,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1544475003, now seen corresponding path program 1 times [2021-10-13 07:55:38,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:38,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516297684] [2021-10-13 07:55:38,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:38,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 07:55:38,376 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:38,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516297684] [2021-10-13 07:55:38,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516297684] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:38,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:38,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:55:38,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451063691] [2021-10-13 07:55:38,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:55:38,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:55:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:55:38,379 INFO L87 Difference]: Start difference. First operand 366 states and 402 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:38,878 INFO L93 Difference]: Finished difference Result 364 states and 400 transitions. [2021-10-13 07:55:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:55:38,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 07:55:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:38,881 INFO L225 Difference]: With dead ends: 364 [2021-10-13 07:55:38,881 INFO L226 Difference]: Without dead ends: 364 [2021-10-13 07:55:38,882 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.2ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:55:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-13 07:55:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2021-10-13 07:55:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 199 states have (on average 1.8341708542713568) internal successors, (365), 342 states have internal predecessors, (365), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-13 07:55:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 400 transitions. [2021-10-13 07:55:38,892 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 400 transitions. Word has length 23 [2021-10-13 07:55:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:38,892 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 400 transitions. [2021-10-13 07:55:38,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 400 transitions. [2021-10-13 07:55:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 07:55:38,893 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:38,893 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:38,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:55:38,894 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash 634114193, now seen corresponding path program 1 times [2021-10-13 07:55:38,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:38,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34999754] [2021-10-13 07:55:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:38,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 07:55:38,934 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:38,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34999754] [2021-10-13 07:55:38,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34999754] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:38,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:38,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:55:38,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675584924] [2021-10-13 07:55:38,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:55:38,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:55:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:55:38,936 INFO L87 Difference]: Start difference. First operand 364 states and 400 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:39,131 INFO L93 Difference]: Finished difference Result 363 states and 399 transitions. [2021-10-13 07:55:39,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:55:39,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 07:55:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:39,134 INFO L225 Difference]: With dead ends: 363 [2021-10-13 07:55:39,134 INFO L226 Difference]: Without dead ends: 363 [2021-10-13 07:55:39,134 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:55:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-10-13 07:55:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2021-10-13 07:55:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 199 states have (on average 1.829145728643216) internal successors, (364), 341 states have internal predecessors, (364), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-13 07:55:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 399 transitions. [2021-10-13 07:55:39,144 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 399 transitions. Word has length 24 [2021-10-13 07:55:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:39,145 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 399 transitions. [2021-10-13 07:55:39,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 399 transitions. [2021-10-13 07:55:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 07:55:39,146 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:39,146 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:39,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:55:39,147 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:39,147 INFO L82 PathProgramCache]: Analyzing trace with hash 634114194, now seen corresponding path program 1 times [2021-10-13 07:55:39,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:39,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705201624] [2021-10-13 07:55:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:39,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 07:55:39,206 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:39,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705201624] [2021-10-13 07:55:39,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705201624] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:39,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:39,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:55:39,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244180684] [2021-10-13 07:55:39,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:55:39,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:39,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:55:39,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:55:39,209 INFO L87 Difference]: Start difference. First operand 363 states and 399 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:39,371 INFO L93 Difference]: Finished difference Result 362 states and 398 transitions. [2021-10-13 07:55:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:55:39,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 07:55:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:39,375 INFO L225 Difference]: With dead ends: 362 [2021-10-13 07:55:39,375 INFO L226 Difference]: Without dead ends: 362 [2021-10-13 07:55:39,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.0ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:55:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-10-13 07:55:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2021-10-13 07:55:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 340 states have internal predecessors, (363), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-13 07:55:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 398 transitions. [2021-10-13 07:55:39,387 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 398 transitions. Word has length 24 [2021-10-13 07:55:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:39,388 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 398 transitions. [2021-10-13 07:55:39,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 398 transitions. [2021-10-13 07:55:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:55:39,393 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:39,393 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:39,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 07:55:39,394 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:39,394 INFO L82 PathProgramCache]: Analyzing trace with hash -501616430, now seen corresponding path program 1 times [2021-10-13 07:55:39,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:39,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256875433] [2021-10-13 07:55:39,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:39,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 07:55:39,564 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:39,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256875433] [2021-10-13 07:55:39,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256875433] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:55:39,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:55:39,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 07:55:39,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424865572] [2021-10-13 07:55:39,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:55:39,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:55:39,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:55:39,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:55:39,566 INFO L87 Difference]: Start difference. First operand 362 states and 398 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:55:40,041 INFO L93 Difference]: Finished difference Result 371 states and 408 transitions. [2021-10-13 07:55:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:55:40,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:55:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:55:40,044 INFO L225 Difference]: With dead ends: 371 [2021-10-13 07:55:40,044 INFO L226 Difference]: Without dead ends: 371 [2021-10-13 07:55:40,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 134.6ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-10-13 07:55:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-10-13 07:55:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 370. [2021-10-13 07:55:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 206 states have (on average 1.796116504854369) internal successors, (370), 348 states have internal predecessors, (370), 15 states have call successors, (15), 10 states have call predecessors, (15), 8 states have return successors, (22), 11 states have call predecessors, (22), 15 states have call successors, (22) [2021-10-13 07:55:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 407 transitions. [2021-10-13 07:55:40,055 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 407 transitions. Word has length 26 [2021-10-13 07:55:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:55:40,056 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 407 transitions. [2021-10-13 07:55:40,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:55:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 407 transitions. [2021-10-13 07:55:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 07:55:40,057 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:55:40,057 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:55:40,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 07:55:40,058 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:55:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:55:40,058 INFO L82 PathProgramCache]: Analyzing trace with hash 510736344, now seen corresponding path program 1 times [2021-10-13 07:55:40,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:55:40,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343238699] [2021-10-13 07:55:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:40,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:55:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-13 07:55:40,304 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:55:40,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343238699] [2021-10-13 07:55:40,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343238699] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:55:40,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912977676] [2021-10-13 07:55:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:55:40,305 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:55:40,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:55:40,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:55:40,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:55:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:55:40,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 47 conjunts are in the unsatisfiable core [2021-10-13 07:55:40,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:55:40,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-10-13 07:55:41,218 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-10-13 07:55:41,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2021-10-13 07:55:41,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:55:41,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2021-10-13 07:55:41,470 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-13 07:55:41,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 43 [2021-10-13 07:55:41,625 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-13 07:55:41,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 38 [2021-10-13 07:55:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:55:41,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:55:45,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 99 [2021-10-13 07:55:45,742 INFO L354 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2021-10-13 07:55:45,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 154 [2021-10-13 07:55:46,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 112 [2021-10-13 07:55:49,700 INFO L354 Elim1Store]: treesize reduction 5, result has 98.6 percent of original size [2021-10-13 07:55:49,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 360 treesize of output 679 [2021-10-13 07:58:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:58:21,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912977676] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:58:21,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [771178103] [2021-10-13 07:58:21,544 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-10-13 07:58:21,544 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 07:58:21,549 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 07:58:21,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 07:58:21,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2021-10-13 07:58:21,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292247549] [2021-10-13 07:58:21,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-10-13 07:58:21,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:58:21,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-10-13 07:58:21,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1417, Unknown=3, NotChecked=0, Total=1560 [2021-10-13 07:58:21,559 INFO L87 Difference]: Start difference. First operand 370 states and 407 transitions. Second operand has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-13 07:58:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:58:25,818 INFO L93 Difference]: Finished difference Result 372 states and 408 transitions. [2021-10-13 07:58:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 07:58:25,819 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-10-13 07:58:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:58:25,821 INFO L225 Difference]: With dead ends: 372 [2021-10-13 07:58:25,821 INFO L226 Difference]: Without dead ends: 372 [2021-10-13 07:58:25,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 7126.9ms TimeCoverageRelationStatistics Valid=415, Invalid=2233, Unknown=4, NotChecked=0, Total=2652 [2021-10-13 07:58:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-13 07:58:25,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 369. [2021-10-13 07:58:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 206 states have (on average 1.7912621359223302) internal successors, (369), 347 states have internal predecessors, (369), 15 states have call successors, (15), 10 states have call predecessors, (15), 8 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-13 07:58:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 404 transitions. [2021-10-13 07:58:25,836 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 404 transitions. Word has length 37 [2021-10-13 07:58:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:58:25,837 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 404 transitions. [2021-10-13 07:58:25,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-13 07:58:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 404 transitions. [2021-10-13 07:58:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 07:58:25,838 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:58:25,838 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:58:25,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:58:26,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-13 07:58:26,066 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:58:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:58:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash 510736345, now seen corresponding path program 1 times [2021-10-13 07:58:26,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:58:26,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531421581] [2021-10-13 07:58:26,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:58:26,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:58:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:58:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-13 07:58:26,398 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:58:26,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531421581] [2021-10-13 07:58:26,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531421581] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:58:26,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073672136] [2021-10-13 07:58:26,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:58:26,398 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:58:26,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:58:26,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:58:26,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 07:58:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:58:26,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 67 conjunts are in the unsatisfiable core [2021-10-13 07:58:26,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:58:26,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:58:26,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2021-10-13 07:58:26,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-10-13 07:58:27,333 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-10-13 07:58:27,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2021-10-13 07:58:27,343 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-10-13 07:58:27,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2021-10-13 07:58:27,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:58:27,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2021-10-13 07:58:27,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:58:27,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2021-10-13 07:58:27,557 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-13 07:58:27,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 68 [2021-10-13 07:58:27,574 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-13 07:58:27,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 61 [2021-10-13 07:58:27,744 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-13 07:58:27,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 59 [2021-10-13 07:58:27,759 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-13 07:58:27,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 41 [2021-10-13 07:58:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:58:27,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:58:29,792 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| Int)) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0)) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.offset|)))) (forall ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| Int)) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0)) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0)) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.offset|))))) is different from false [2021-10-13 07:58:38,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 266 [2021-10-13 07:58:38,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 489 treesize of output 469 [2021-10-13 07:58:38,616 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:58:38,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 615 treesize of output 599 [2021-10-13 07:58:38,664 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-10-13 07:58:38,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 467 treesize of output 466 [2021-10-13 07:58:41,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 267 [2021-10-13 07:58:41,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 526 treesize of output 506 [2021-10-13 07:58:44,577 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-10-13 07:58:44,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 175 [2021-10-13 07:58:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2021-10-13 07:58:45,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073672136] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:58:45,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1093820743] [2021-10-13 07:58:45,979 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-10-13 07:58:45,980 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 07:58:45,980 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 07:58:45,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 07:58:45,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 41 [2021-10-13 07:58:45,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821442480] [2021-10-13 07:58:45,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-10-13 07:58:45,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:58:45,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-10-13 07:58:45,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1498, Unknown=5, NotChecked=78, Total=1722 [2021-10-13 07:58:45,986 INFO L87 Difference]: Start difference. First operand 369 states and 404 transitions. Second operand has 42 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-13 07:58:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:58:50,436 INFO L93 Difference]: Finished difference Result 368 states and 403 transitions. [2021-10-13 07:58:50,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-13 07:58:50,437 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-10-13 07:58:50,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:58:50,439 INFO L225 Difference]: With dead ends: 368 [2021-10-13 07:58:50,439 INFO L226 Difference]: Without dead ends: 368 [2021-10-13 07:58:50,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 12732.8ms TimeCoverageRelationStatistics Valid=470, Invalid=2499, Unknown=5, NotChecked=106, Total=3080 [2021-10-13 07:58:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-10-13 07:58:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2021-10-13 07:58:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 206 states have (on average 1.7864077669902914) internal successors, (368), 346 states have internal predecessors, (368), 15 states have call successors, (15), 10 states have call predecessors, (15), 8 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-13 07:58:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 403 transitions. [2021-10-13 07:58:50,451 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 403 transitions. Word has length 37 [2021-10-13 07:58:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:58:50,451 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 403 transitions. [2021-10-13 07:58:50,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-13 07:58:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 403 transitions. [2021-10-13 07:58:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 07:58:50,453 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:58:50,453 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:58:50,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:58:50,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-13 07:58:50,678 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting dll_insert_masterErr10REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:58:50,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:58:50,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1249289076, now seen corresponding path program 1 times [2021-10-13 07:58:50,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:58:50,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197131724] [2021-10-13 07:58:50,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:58:50,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:58:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:58:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:58:50,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:58:50,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197131724] [2021-10-13 07:58:50,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197131724] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:58:50,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:58:50,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:58:50,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964293034] [2021-10-13 07:58:50,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:58:50,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:58:50,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:58:50,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:58:50,794 INFO L87 Difference]: Start difference. First operand 368 states and 403 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 07:58:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:58:50,833 INFO L93 Difference]: Finished difference Result 357 states and 380 transitions. [2021-10-13 07:58:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:58:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-13 07:58:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:58:50,836 INFO L225 Difference]: With dead ends: 357 [2021-10-13 07:58:50,836 INFO L226 Difference]: Without dead ends: 357 [2021-10-13 07:58:50,836 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:58:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-13 07:58:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-13 07:58:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 198 states have (on average 1.792929292929293) internal successors, (355), 338 states have internal predecessors, (355), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2021-10-13 07:58:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 380 transitions. [2021-10-13 07:58:50,847 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 380 transitions. Word has length 40 [2021-10-13 07:58:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:58:50,848 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 380 transitions. [2021-10-13 07:58:50,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 07:58:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 380 transitions. [2021-10-13 07:58:50,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 07:58:50,851 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:58:50,852 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:58:50,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 07:58:50,852 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting dll_insert_masterErr12REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 07:58:50,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:58:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash 715579460, now seen corresponding path program 1 times [2021-10-13 07:58:50,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:58:50,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692433560] [2021-10-13 07:58:50,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:58:50,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:58:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:58:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-13 07:58:51,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:58:51,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692433560] [2021-10-13 07:58:51,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692433560] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:58:51,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915044597] [2021-10-13 07:58:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:58:51,275 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:58:51,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:58:51,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:58:51,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 07:58:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:58:51,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 59 conjunts are in the unsatisfiable core [2021-10-13 07:58:51,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:58:51,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-10-13 07:59:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:59:14,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:00:32,646 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-13 08:00:32,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2021-10-13 08:00:36,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2021-10-13 08:00:36,894 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-10-13 08:00:36,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-10-13 08:00:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-13 08:00:36,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915044597] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 08:00:36,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [916707679] [2021-10-13 08:00:36,990 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2021-10-13 08:00:36,990 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 08:00:36,991 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 08:00:36,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 08:00:36,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 34 [2021-10-13 08:00:36,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988712002] [2021-10-13 08:00:36,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-10-13 08:00:36,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:00:36,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-13 08:00:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=963, Unknown=42, NotChecked=0, Total=1122 [2021-10-13 08:00:36,997 INFO L87 Difference]: Start difference. First operand 357 states and 380 transitions. Second operand has 34 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 5 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-10-13 08:01:41,077 WARN L207 SmtUtils]: Spent 16.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2021-10-13 08:02:05,582 WARN L207 SmtUtils]: Spent 16.09 s on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2021-10-13 08:02:37,679 WARN L207 SmtUtils]: Spent 21.97 s on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2021-10-13 08:03:07,096 WARN L207 SmtUtils]: Spent 16.11 s on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2021-10-13 08:03:13,189 WARN L207 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2021-10-13 08:03:19,287 WARN L207 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2021-10-13 08:04:13,410 WARN L207 SmtUtils]: Spent 18.11 s on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2021-10-13 08:04:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:04:31,195 INFO L93 Difference]: Finished difference Result 360 states and 382 transitions. [2021-10-13 08:04:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-13 08:04:31,196 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 5 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 46 [2021-10-13 08:04:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:04:31,201 INFO L225 Difference]: With dead ends: 360 [2021-10-13 08:04:31,201 INFO L226 Difference]: Without dead ends: 357 [2021-10-13 08:04:31,202 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 241337.0ms TimeCoverageRelationStatistics Valid=310, Invalid=1796, Unknown=56, NotChecked=0, Total=2162 [2021-10-13 08:04:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-13 08:04:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-13 08:04:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 198 states have (on average 1.7878787878787878) internal successors, (354), 338 states have internal predecessors, (354), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2021-10-13 08:04:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 379 transitions. [2021-10-13 08:04:31,212 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 379 transitions. Word has length 46 [2021-10-13 08:04:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:04:31,212 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 379 transitions. [2021-10-13 08:04:31,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 5 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-10-13 08:04:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 379 transitions. [2021-10-13 08:04:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 08:04:31,213 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:04:31,214 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:04:31,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 08:04:31,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:04:31,431 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting dll_insert_masterErr12REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-13 08:04:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:04:31,431 INFO L82 PathProgramCache]: Analyzing trace with hash -633747766, now seen corresponding path program 1 times [2021-10-13 08:04:31,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:04:31,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753174860] [2021-10-13 08:04:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:04:31,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:04:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:04:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:04:32,586 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:04:32,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753174860] [2021-10-13 08:04:32,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753174860] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 08:04:32,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417571637] [2021-10-13 08:04:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:04:32,587 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:04:32,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:04:32,588 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 08:04:32,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 08:04:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:04:32,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 30 conjunts are in the unsatisfiable core [2021-10-13 08:04:32,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:04:33,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:04:33,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-10-13 08:04:33,298 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-13 08:04:33,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-10-13 08:04:33,854 INFO L354 Elim1Store]: treesize reduction 109, result has 18.0 percent of original size [2021-10-13 08:04:33,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 47 [2021-10-13 08:04:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 08:04:33,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:04:52,988 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:04:52,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 251 treesize of output 359 [2021-10-13 08:05:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 08:05:33,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417571637] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 08:05:33,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [688913770] [2021-10-13 08:05:33,536 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2021-10-13 08:05:33,536 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 08:05:33,537 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 08:05:33,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 08:05:33,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 12] total 41 [2021-10-13 08:05:33,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565663306] [2021-10-13 08:05:33,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-10-13 08:05:33,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:05:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-10-13 08:05:33,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1425, Unknown=27, NotChecked=0, Total=1640 [2021-10-13 08:05:33,540 INFO L87 Difference]: Start difference. First operand 357 states and 379 transitions. Second operand has 41 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 11 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-10-13 08:05:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:05:44,655 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2021-10-13 08:05:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 08:05:44,655 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 11 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 47 [2021-10-13 08:05:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:05:44,656 INFO L225 Difference]: With dead ends: 20 [2021-10-13 08:05:44,656 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 08:05:44,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 67878.2ms TimeCoverageRelationStatistics Valid=304, Invalid=2118, Unknown=28, NotChecked=0, Total=2450 [2021-10-13 08:05:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 08:05:44,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 08:05:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 08:05:44,658 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-10-13 08:05:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:05:44,658 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 08:05:44,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 11 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-10-13 08:05:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 08:05:44,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 08:05:44,661 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION [2021-10-13 08:05:44,662 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION [2021-10-13 08:05:44,662 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION [2021-10-13 08:05:44,662 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr3REQUIRES_VIOLATION [2021-10-13 08:05:44,663 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATION [2021-10-13 08:05:44,663 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATION [2021-10-13 08:05:44,663 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATION [2021-10-13 08:05:44,663 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATION [2021-10-13 08:05:44,663 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATION [2021-10-13 08:05:44,664 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATION [2021-10-13 08:05:44,664 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr10REQUIRES_VIOLATION [2021-10-13 08:05:44,664 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr11REQUIRES_VIOLATION [2021-10-13 08:05:44,664 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr0REQUIRES_VIOLATION [2021-10-13 08:05:44,664 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr1REQUIRES_VIOLATION [2021-10-13 08:05:44,665 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr2REQUIRES_VIOLATION [2021-10-13 08:05:44,665 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr3REQUIRES_VIOLATION [2021-10-13 08:05:44,665 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr4REQUIRES_VIOLATION [2021-10-13 08:05:44,665 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr5REQUIRES_VIOLATION [2021-10-13 08:05:44,666 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr6REQUIRES_VIOLATION [2021-10-13 08:05:44,666 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr7REQUIRES_VIOLATION [2021-10-13 08:05:44,666 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr8REQUIRES_VIOLATION [2021-10-13 08:05:44,666 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr9REQUIRES_VIOLATION [2021-10-13 08:05:44,666 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr10REQUIRES_VIOLATION [2021-10-13 08:05:44,667 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr11REQUIRES_VIOLATION [2021-10-13 08:05:44,667 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr12REQUIRES_VIOLATION [2021-10-13 08:05:44,667 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr13REQUIRES_VIOLATION [2021-10-13 08:05:44,667 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr14REQUIRES_VIOLATION [2021-10-13 08:05:44,667 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr15REQUIRES_VIOLATION [2021-10-13 08:05:44,667 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_create_genericErr0REQUIRES_VIOLATION [2021-10-13 08:05:44,668 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_create_genericErr1REQUIRES_VIOLATION [2021-10-13 08:05:44,668 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,668 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 08:05:44,668 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 08:05:44,668 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,668 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 08:05:44,668 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 08:05:44,668 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,668 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-13 08:05:44,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-13 08:05:44,670 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-13 08:05:44,670 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-13 08:05:44,670 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,670 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-13 08:05:44,670 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-13 08:05:44,670 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-13 08:05:44,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-13 08:05:44,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-13 08:05:44,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-13 08:05:44,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-13 08:05:44,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-13 08:05:44,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-13 08:05:44,672 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-13 08:05:44,673 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-13 08:05:44,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-13 08:05:44,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-13 08:05:44,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-13 08:05:44,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-13 08:05:44,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-13 08:05:44,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-13 08:05:44,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-13 08:05:44,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-13 08:05:44,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-13 08:05:44,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-13 08:05:44,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103REQUIRES_VIOLATION [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111REQUIRES_VIOLATION [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114REQUIRES_VIOLATION [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-13 08:05:44,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-10-13 08:05:44,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-10-13 08:05:44,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-10-13 08:05:44,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:05:44,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:05:44,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:05:44,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:05:44,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 08:05:44,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:05:44,900 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 08:05:44,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:05:44 BoogieIcfgContainer [2021-10-13 08:05:44,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 08:05:44,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 08:05:44,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 08:05:44,911 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 08:05:44,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:55:33" (3/4) ... [2021-10-13 08:05:44,914 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 08:05:44,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create_slave [2021-10-13 08:05:44,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2021-10-13 08:05:44,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_insert_master [2021-10-13 08:05:44,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create_generic [2021-10-13 08:05:44,950 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-10-13 08:05:44,950 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-10-13 08:05:44,951 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-13 08:05:44,951 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 08:05:44,996 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 08:05:44,996 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 08:05:44,997 INFO L168 Benchmark]: Toolchain (without parser) took 613941.92 ms. Allocated memory was 94.4 MB in the beginning and 394.3 MB in the end (delta: 299.9 MB). Free memory was 63.1 MB in the beginning and 145.8 MB in the end (delta: -82.7 MB). Peak memory consumption was 216.6 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:44,998 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 94.4 MB. Free memory is still 49.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:05:44,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 529.55 ms. Allocated memory is still 94.4 MB. Free memory was 62.9 MB in the beginning and 62.4 MB in the end (delta: 517.5 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:44,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.93 ms. Allocated memory is still 94.4 MB. Free memory was 62.4 MB in the beginning and 59.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:44,999 INFO L168 Benchmark]: Boogie Preprocessor took 116.41 ms. Allocated memory is still 94.4 MB. Free memory was 59.0 MB in the beginning and 55.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:44,999 INFO L168 Benchmark]: RCFGBuilder took 1305.58 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 55.1 MB in the beginning and 82.6 MB in the end (delta: -27.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:44,999 INFO L168 Benchmark]: TraceAbstraction took 611785.42 ms. Allocated memory was 113.2 MB in the beginning and 394.3 MB in the end (delta: 281.0 MB). Free memory was 81.8 MB in the beginning and 151.2 MB in the end (delta: -69.4 MB). Peak memory consumption was 210.3 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:45,000 INFO L168 Benchmark]: Witness Printer took 86.38 ms. Allocated memory is still 394.3 MB. Free memory was 151.2 MB in the beginning and 145.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:45,001 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 94.4 MB. Free memory is still 49.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 529.55 ms. Allocated memory is still 94.4 MB. Free memory was 62.9 MB in the beginning and 62.4 MB in the end (delta: 517.5 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 111.93 ms. Allocated memory is still 94.4 MB. Free memory was 62.4 MB in the beginning and 59.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 116.41 ms. Allocated memory is still 94.4 MB. Free memory was 59.0 MB in the beginning and 55.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1305.58 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 55.1 MB in the beginning and 82.6 MB in the end (delta: -27.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 611785.42 ms. Allocated memory was 113.2 MB in the beginning and 394.3 MB in the end (delta: 281.0 MB). Free memory was 81.8 MB in the beginning and 151.2 MB in the end (delta: -69.4 MB). Peak memory consumption was 210.3 MB. Max. memory is 16.1 GB. * Witness Printer took 86.38 ms. Allocated memory is still 394.3 MB. Free memory was 151.2 MB in the beginning and 145.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 574]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 574]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 657]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 657]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 673]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 673]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 672]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 672]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 617]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 617]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 679]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 679]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 678]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 678]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 625]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 625]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 681]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 342 locations, 159 error locations. Started 1 CEGAR loops. OverallTime: 611707.7ms, OverallIterations: 20, TraceHistogramMax: 3, EmptinessCheckTime: 35.5ms, AutomataDifference: 259044.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 30.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6383 SDtfs, 827 SDslu, 27048 SDs, 0 SdLazy, 13406 SolverSat, 403 SolverUnsat, 46 SolverUnknown, 0 SolverNotchecked, 104641.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 273 SyntacticMatches, 3 SemanticMatches, 271 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2129 ImplicationChecksByTransitivity, 329639.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=15, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 273.9ms AutomataMinimizationTime, 20 MinimizatonAttempts, 45 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 159.1ms SsaConstructionTime, 595.6ms SatisfiabilityAnalysisTime, 349445.6ms InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 739 ConstructedInterpolants, 108 QuantifiedInterpolants, 11240 SizeOfPredicates, 99 NumberOfNonLiveVariables, 1546 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 125/210 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 - AllSpecificationsHoldResult: All specifications hold 159 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-13 08:05:45,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9edfd769-3b38-42c6-b6c5-4395bb19a5e6/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...