./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 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/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_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8 --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 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:06:02,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:06:02,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:06:02,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:06:02,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:06:02,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:06:02,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:06:02,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:06:02,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:06:02,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:06:02,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:06:02,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:06:02,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:06:02,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:06:02,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:06:02,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:06:02,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:06:02,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:06:02,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:06:02,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:06:02,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:06:02,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:06:02,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:06:02,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:06:02,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:06:02,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:06:02,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:06:02,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:06:02,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:06:02,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:06:02,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:06:02,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:06:02,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:06:02,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:06:02,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:06:02,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:06:02,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:06:02,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:06:02,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:06:02,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:06:02,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:06:02,766 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-07 01:06:02,824 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:06:02,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:06:02,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:06:02,826 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:06:02,826 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:06:02,827 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:06:02,827 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:06:02,827 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:06:02,828 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:06:02,828 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:06:02,829 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:06:02,830 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:06:02,830 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:06:02,830 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:06:02,831 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:06:02,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 01:06:02,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 01:06:02,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:06:02,832 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:06:02,833 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 01:06:02,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:06:02,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:06:02,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:06:02,834 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 01:06:02,834 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 01:06:02,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:06:02,837 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:06:02,837 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:06:02,837 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:06:02,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:06:02,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:06:02,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:06:02,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:06:02,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:06:02,840 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:06:02,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:06:02,840 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:06:02,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:06:02,841 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_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/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_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8 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 -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2021-11-07 01:06:03,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:06:03,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:06:03,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:06:03,252 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:06:03,253 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:06:03,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2021-11-07 01:06:03,346 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/data/78d57d72e/d1cca8373ee6491eae5261b10f97bb20/FLAGa9e9e38eb [2021-11-07 01:06:04,073 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:06:04,074 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2021-11-07 01:06:04,119 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/data/78d57d72e/d1cca8373ee6491eae5261b10f97bb20/FLAGa9e9e38eb [2021-11-07 01:06:04,282 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/data/78d57d72e/d1cca8373ee6491eae5261b10f97bb20 [2021-11-07 01:06:04,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:06:04,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:06:04,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:06:04,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:06:04,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:06:04,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:04" (1/1) ... [2021-11-07 01:06:04,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73daec99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:04, skipping insertion in model container [2021-11-07 01:06:04,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:04" (1/1) ... [2021-11-07 01:06:04,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:06:04,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:06:04,878 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_64de6867-bf37-4ba8-a941-54d0f203016d/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2021-11-07 01:06:04,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:06:04,993 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:06:05,054 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_64de6867-bf37-4ba8-a941-54d0f203016d/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2021-11-07 01:06:05,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:06:05,153 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:06:05,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05 WrapperNode [2021-11-07 01:06:05,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:06:05,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:06:05,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:06:05,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:06:05,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (1/1) ... [2021-11-07 01:06:05,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (1/1) ... [2021-11-07 01:06:05,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:06:05,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:06:05,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:06:05,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:06:05,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (1/1) ... [2021-11-07 01:06:05,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (1/1) ... [2021-11-07 01:06:05,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (1/1) ... [2021-11-07 01:06:05,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (1/1) ... [2021-11-07 01:06:05,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (1/1) ... [2021-11-07 01:06:05,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (1/1) ... [2021-11-07 01:06:05,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (1/1) ... [2021-11-07 01:06:05,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:06:05,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:06:05,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:06:05,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:06:05,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (1/1) ... [2021-11-07 01:06:05,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:06:05,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:06:05,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:06:05,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:06:05,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 01:06:05,516 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2021-11-07 01:06:05,517 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2021-11-07 01:06:05,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 01:06:05,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:06:05,517 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-07 01:06:05,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-07 01:06:05,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 01:06:05,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:06:05,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 01:06:05,518 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2021-11-07 01:06:05,518 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2021-11-07 01:06:05,519 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2021-11-07 01:06:05,519 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2021-11-07 01:06:05,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:06:05,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:06:05,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:06:07,173 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:06:07,174 INFO L299 CfgBuilder]: Removed 148 assume(true) statements. [2021-11-07 01:06:07,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:07 BoogieIcfgContainer [2021-11-07 01:06:07,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:06:07,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:06:07,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:06:07,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:06:07,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:04" (1/3) ... [2021-11-07 01:06:07,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb1187c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:07, skipping insertion in model container [2021-11-07 01:06:07,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:05" (2/3) ... [2021-11-07 01:06:07,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb1187c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:07, skipping insertion in model container [2021-11-07 01:06:07,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:07" (3/3) ... [2021-11-07 01:06:07,188 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2021-11-07 01:06:07,194 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:06:07,195 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 159 error locations. [2021-11-07 01:06:07,246 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:06:07,253 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:06:07,254 INFO L340 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2021-11-07 01:06:07,283 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-11-07 01:06:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 01:06:07,291 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:07,292 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:07,293 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-11-07 01:06:07,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1934548942, now seen corresponding path program 1 times [2021-11-07 01:06:07,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:07,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597121913] [2021-11-07 01:06:07,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:07,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:07,629 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:07,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597121913] [2021-11-07 01:06:07,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597121913] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:07,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:07,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:06:07,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22046067] [2021-11-07 01:06:07,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:06:07,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:07,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:06:07,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:06:07,674 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-11-07 01:06:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:08,072 INFO L93 Difference]: Finished difference Result 342 states and 361 transitions. [2021-11-07 01:06:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:06:08,074 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-11-07 01:06:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:08,090 INFO L225 Difference]: With dead ends: 342 [2021-11-07 01:06:08,090 INFO L226 Difference]: Without dead ends: 341 [2021-11-07 01:06:08,092 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:06:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-07 01:06:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2021-11-07 01:06:08,159 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-11-07 01:06:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 356 transitions. [2021-11-07 01:06:08,165 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 356 transitions. Word has length 7 [2021-11-07 01:06:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:08,166 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 356 transitions. [2021-11-07 01:06:08,166 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-11-07 01:06:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 356 transitions. [2021-11-07 01:06:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 01:06:08,167 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:08,167 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:08,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:06:08,168 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-11-07 01:06:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:08,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1934548943, now seen corresponding path program 1 times [2021-11-07 01:06:08,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:08,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008866385] [2021-11-07 01:06:08,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:08,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:08,264 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:08,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008866385] [2021-11-07 01:06:08,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008866385] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:08,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:08,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:06:08,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284249871] [2021-11-07 01:06:08,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:06:08,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:08,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:06:08,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:06:08,269 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-11-07 01:06:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:08,550 INFO L93 Difference]: Finished difference Result 339 states and 358 transitions. [2021-11-07 01:06:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:06:08,551 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-11-07 01:06:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:08,558 INFO L225 Difference]: With dead ends: 339 [2021-11-07 01:06:08,560 INFO L226 Difference]: Without dead ends: 339 [2021-11-07 01:06:08,561 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:06:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-11-07 01:06:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2021-11-07 01:06:08,612 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-11-07 01:06:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 354 transitions. [2021-11-07 01:06:08,616 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 354 transitions. Word has length 7 [2021-11-07 01:06:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:08,617 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 354 transitions. [2021-11-07 01:06:08,617 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-11-07 01:06:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 354 transitions. [2021-11-07 01:06:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:06:08,619 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:08,619 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:08,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:06:08,623 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-11-07 01:06:08,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash -647647508, now seen corresponding path program 1 times [2021-11-07 01:06:08,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:08,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949188134] [2021-11-07 01:06:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:08,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:08,715 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:08,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949188134] [2021-11-07 01:06:08,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949188134] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:08,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:08,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:06:08,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813902451] [2021-11-07 01:06:08,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:06:08,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:06:08,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:06:08,720 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-11-07 01:06:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:08,980 INFO L93 Difference]: Finished difference Result 334 states and 351 transitions. [2021-11-07 01:06:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:06:08,981 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-11-07 01:06:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:08,985 INFO L225 Difference]: With dead ends: 334 [2021-11-07 01:06:08,985 INFO L226 Difference]: Without dead ends: 334 [2021-11-07 01:06:08,986 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:06:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-07 01:06:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2021-11-07 01:06:09,024 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-11-07 01:06:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 351 transitions. [2021-11-07 01:06:09,028 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 351 transitions. Word has length 9 [2021-11-07 01:06:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:09,029 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 351 transitions. [2021-11-07 01:06:09,029 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-11-07 01:06:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 351 transitions. [2021-11-07 01:06:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:06:09,030 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:09,030 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:09,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:06:09,031 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-11-07 01:06:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash -647647507, now seen corresponding path program 1 times [2021-11-07 01:06:09,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:09,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731993034] [2021-11-07 01:06:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:09,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:09,119 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:09,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731993034] [2021-11-07 01:06:09,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731993034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:09,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:09,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:06:09,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280015146] [2021-11-07 01:06:09,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:06:09,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:06:09,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:06:09,126 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-11-07 01:06:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:09,387 INFO L93 Difference]: Finished difference Result 331 states and 348 transitions. [2021-11-07 01:06:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:06:09,388 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-11-07 01:06:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:09,391 INFO L225 Difference]: With dead ends: 331 [2021-11-07 01:06:09,392 INFO L226 Difference]: Without dead ends: 331 [2021-11-07 01:06:09,392 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:06:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-11-07 01:06:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2021-11-07 01:06:09,408 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-11-07 01:06:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 348 transitions. [2021-11-07 01:06:09,411 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 348 transitions. Word has length 9 [2021-11-07 01:06:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:09,412 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 348 transitions. [2021-11-07 01:06:09,412 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-11-07 01:06:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 348 transitions. [2021-11-07 01:06:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:06:09,413 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:09,414 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:09,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:06:09,415 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-11-07 01:06:09,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:09,416 INFO L85 PathProgramCache]: Analyzing trace with hash -619277081, now seen corresponding path program 1 times [2021-11-07 01:06:09,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:09,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489987573] [2021-11-07 01:06:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:09,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:09,586 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:09,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489987573] [2021-11-07 01:06:09,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489987573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:09,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:09,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:06:09,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574514572] [2021-11-07 01:06:09,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:06:09,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:09,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:06:09,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:06:09,590 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-11-07 01:06:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:09,717 INFO L93 Difference]: Finished difference Result 353 states and 378 transitions. [2021-11-07 01:06:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:06:09,718 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-11-07 01:06:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:09,722 INFO L225 Difference]: With dead ends: 353 [2021-11-07 01:06:09,722 INFO L226 Difference]: Without dead ends: 353 [2021-11-07 01:06:09,722 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:06:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-11-07 01:06:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 347. [2021-11-07 01:06:09,739 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-11-07 01:06:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 374 transitions. [2021-11-07 01:06:09,742 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 374 transitions. Word has length 9 [2021-11-07 01:06:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:09,743 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 374 transitions. [2021-11-07 01:06:09,743 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-11-07 01:06:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 374 transitions. [2021-11-07 01:06:09,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:06:09,750 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:09,751 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:09,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:06:09,751 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-11-07 01:06:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1073762538, now seen corresponding path program 1 times [2021-11-07 01:06:09,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:09,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140704530] [2021-11-07 01:06:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:09,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:09,930 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:09,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140704530] [2021-11-07 01:06:09,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140704530] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:09,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:09,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 01:06:09,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013438167] [2021-11-07 01:06:09,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:06:09,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:09,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:06:09,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:06:09,934 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-11-07 01:06:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:10,596 INFO L93 Difference]: Finished difference Result 366 states and 396 transitions. [2021-11-07 01:06:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:06:10,597 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-11-07 01:06:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:10,600 INFO L225 Difference]: With dead ends: 366 [2021-11-07 01:06:10,601 INFO L226 Difference]: Without dead ends: 366 [2021-11-07 01:06:10,601 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:06:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-07 01:06:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 356. [2021-11-07 01:06:10,617 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-11-07 01:06:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 386 transitions. [2021-11-07 01:06:10,620 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 386 transitions. Word has length 12 [2021-11-07 01:06:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:10,621 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 386 transitions. [2021-11-07 01:06:10,621 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-11-07 01:06:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 386 transitions. [2021-11-07 01:06:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:06:10,622 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:10,622 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:10,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:06:10,622 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-11-07 01:06:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:10,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1073762537, now seen corresponding path program 1 times [2021-11-07 01:06:10,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:10,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597228027] [2021-11-07 01:06:10,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:10,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:10,828 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:10,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597228027] [2021-11-07 01:06:10,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597228027] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:10,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:10,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:06:10,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439124960] [2021-11-07 01:06:10,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:06:10,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:06:10,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:06:10,831 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-11-07 01:06:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:11,655 INFO L93 Difference]: Finished difference Result 364 states and 394 transitions. [2021-11-07 01:06:11,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:06:11,656 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-11-07 01:06:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:11,659 INFO L225 Difference]: With dead ends: 364 [2021-11-07 01:06:11,660 INFO L226 Difference]: Without dead ends: 364 [2021-11-07 01:06:11,660 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:06:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-07 01:06:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 356. [2021-11-07 01:06:11,675 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-11-07 01:06:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 384 transitions. [2021-11-07 01:06:11,678 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 384 transitions. Word has length 12 [2021-11-07 01:06:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:11,679 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 384 transitions. [2021-11-07 01:06:11,679 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-11-07 01:06:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 384 transitions. [2021-11-07 01:06:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:06:11,681 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:11,682 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:11,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:06:11,682 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-11-07 01:06:11,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:11,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1073127878, now seen corresponding path program 1 times [2021-11-07 01:06:11,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:11,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065000199] [2021-11-07 01:06:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:11,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:11,758 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:11,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065000199] [2021-11-07 01:06:11,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065000199] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:11,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:11,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:06:11,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067102742] [2021-11-07 01:06:11,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:06:11,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:11,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:06:11,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:06:11,761 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-11-07 01:06:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:12,031 INFO L93 Difference]: Finished difference Result 355 states and 383 transitions. [2021-11-07 01:06:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:06:12,032 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-11-07 01:06:12,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:12,035 INFO L225 Difference]: With dead ends: 355 [2021-11-07 01:06:12,035 INFO L226 Difference]: Without dead ends: 355 [2021-11-07 01:06:12,035 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:06:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-11-07 01:06:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2021-11-07 01:06:12,051 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-11-07 01:06:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 383 transitions. [2021-11-07 01:06:12,054 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 383 transitions. Word has length 13 [2021-11-07 01:06:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:12,055 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 383 transitions. [2021-11-07 01:06:12,055 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-11-07 01:06:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 383 transitions. [2021-11-07 01:06:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:06:12,056 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:12,056 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:12,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:06:12,058 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-11-07 01:06:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1073127879, now seen corresponding path program 1 times [2021-11-07 01:06:12,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:12,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446887820] [2021-11-07 01:06:12,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:12,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:12,152 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:12,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446887820] [2021-11-07 01:06:12,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446887820] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:12,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:12,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:06:12,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422013269] [2021-11-07 01:06:12,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:06:12,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:12,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:06:12,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:06:12,155 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-11-07 01:06:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:12,356 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2021-11-07 01:06:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:06:12,357 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-11-07 01:06:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:12,360 INFO L225 Difference]: With dead ends: 354 [2021-11-07 01:06:12,360 INFO L226 Difference]: Without dead ends: 354 [2021-11-07 01:06:12,361 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:06:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-07 01:06:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2021-11-07 01:06:12,371 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-11-07 01:06:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 382 transitions. [2021-11-07 01:06:12,374 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 382 transitions. Word has length 13 [2021-11-07 01:06:12,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:12,375 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 382 transitions. [2021-11-07 01:06:12,375 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-11-07 01:06:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 382 transitions. [2021-11-07 01:06:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:06:12,376 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:12,376 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:12,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:06:12,376 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-11-07 01:06:12,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash 483741159, now seen corresponding path program 1 times [2021-11-07 01:06:12,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:12,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454799505] [2021-11-07 01:06:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:12,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:12,648 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:12,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454799505] [2021-11-07 01:06:12,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454799505] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:12,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:12,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:06:12,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669770342] [2021-11-07 01:06:12,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 01:06:12,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:12,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 01:06:12,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:06:12,650 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-11-07 01:06:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:13,428 INFO L93 Difference]: Finished difference Result 381 states and 414 transitions. [2021-11-07 01:06:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:06:13,429 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-11-07 01:06:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:13,432 INFO L225 Difference]: With dead ends: 381 [2021-11-07 01:06:13,432 INFO L226 Difference]: Without dead ends: 381 [2021-11-07 01:06:13,433 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:06:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-07 01:06:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 368. [2021-11-07 01:06:13,447 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-11-07 01:06:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 404 transitions. [2021-11-07 01:06:13,452 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 404 transitions. Word has length 15 [2021-11-07 01:06:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:13,452 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 404 transitions. [2021-11-07 01:06:13,452 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-11-07 01:06:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 404 transitions. [2021-11-07 01:06:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:06:13,454 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:13,454 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:13,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:06:13,455 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-11-07 01:06:13,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1544475002, now seen corresponding path program 1 times [2021-11-07 01:06:13,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:13,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283963290] [2021-11-07 01:06:13,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:13,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:06:13,588 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:13,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283963290] [2021-11-07 01:06:13,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283963290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:13,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:13,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:06:13,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249368183] [2021-11-07 01:06:13,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:06:13,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:13,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:06:13,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:06:13,594 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-11-07 01:06:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:14,142 INFO L93 Difference]: Finished difference Result 366 states and 402 transitions. [2021-11-07 01:06:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:06:14,143 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-11-07 01:06:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:14,146 INFO L225 Difference]: With dead ends: 366 [2021-11-07 01:06:14,146 INFO L226 Difference]: Without dead ends: 366 [2021-11-07 01:06:14,147 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:06:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-07 01:06:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-11-07 01:06:14,160 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-11-07 01:06:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 402 transitions. [2021-11-07 01:06:14,163 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 402 transitions. Word has length 23 [2021-11-07 01:06:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:14,164 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 402 transitions. [2021-11-07 01:06:14,165 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-11-07 01:06:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 402 transitions. [2021-11-07 01:06:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:06:14,166 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:14,166 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:14,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:06:14,167 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-11-07 01:06:14,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:14,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1544475003, now seen corresponding path program 1 times [2021-11-07 01:06:14,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:14,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883725932] [2021-11-07 01:06:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:14,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:06:14,320 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:14,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883725932] [2021-11-07 01:06:14,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883725932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:14,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:14,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:06:14,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235591827] [2021-11-07 01:06:14,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:06:14,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:14,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:06:14,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:06:14,325 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-11-07 01:06:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:14,973 INFO L93 Difference]: Finished difference Result 364 states and 400 transitions. [2021-11-07 01:06:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:06:14,974 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-11-07 01:06:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:14,978 INFO L225 Difference]: With dead ends: 364 [2021-11-07 01:06:14,978 INFO L226 Difference]: Without dead ends: 364 [2021-11-07 01:06:14,978 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:06:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-07 01:06:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2021-11-07 01:06:14,990 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-11-07 01:06:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 400 transitions. [2021-11-07 01:06:14,994 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 400 transitions. Word has length 23 [2021-11-07 01:06:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:14,994 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 400 transitions. [2021-11-07 01:06:14,994 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-11-07 01:06:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 400 transitions. [2021-11-07 01:06:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:06:15,000 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:15,000 INFO L513 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-11-07 01:06:15,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:06:15,001 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-11-07 01:06:15,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:15,001 INFO L85 PathProgramCache]: Analyzing trace with hash 634114193, now seen corresponding path program 1 times [2021-11-07 01:06:15,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:15,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722275034] [2021-11-07 01:06:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:15,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:06:15,051 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:15,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722275034] [2021-11-07 01:06:15,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722275034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:15,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:15,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:06:15,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884274755] [2021-11-07 01:06:15,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:06:15,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:15,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:06:15,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:06:15,054 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-11-07 01:06:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:15,305 INFO L93 Difference]: Finished difference Result 363 states and 399 transitions. [2021-11-07 01:06:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:06:15,305 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-11-07 01:06:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:15,309 INFO L225 Difference]: With dead ends: 363 [2021-11-07 01:06:15,309 INFO L226 Difference]: Without dead ends: 363 [2021-11-07 01:06:15,310 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:06:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-11-07 01:06:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2021-11-07 01:06:15,322 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-11-07 01:06:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 399 transitions. [2021-11-07 01:06:15,324 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 399 transitions. Word has length 24 [2021-11-07 01:06:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:15,325 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 399 transitions. [2021-11-07 01:06:15,325 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-11-07 01:06:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 399 transitions. [2021-11-07 01:06:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:06:15,326 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:15,327 INFO L513 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-11-07 01:06:15,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:06:15,327 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-11-07 01:06:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash 634114194, now seen corresponding path program 1 times [2021-11-07 01:06:15,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:15,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375149289] [2021-11-07 01:06:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:15,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:06:15,426 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:15,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375149289] [2021-11-07 01:06:15,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375149289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:15,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:15,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:06:15,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162916955] [2021-11-07 01:06:15,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:06:15,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:15,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:06:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:06:15,429 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-11-07 01:06:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:15,645 INFO L93 Difference]: Finished difference Result 362 states and 398 transitions. [2021-11-07 01:06:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:06:15,646 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-11-07 01:06:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:15,649 INFO L225 Difference]: With dead ends: 362 [2021-11-07 01:06:15,649 INFO L226 Difference]: Without dead ends: 362 [2021-11-07 01:06:15,650 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:06:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-11-07 01:06:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2021-11-07 01:06:15,663 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-11-07 01:06:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 398 transitions. [2021-11-07 01:06:15,666 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 398 transitions. Word has length 24 [2021-11-07 01:06:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:15,667 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 398 transitions. [2021-11-07 01:06:15,667 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-11-07 01:06:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 398 transitions. [2021-11-07 01:06:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 01:06:15,668 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:15,669 INFO L513 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-11-07 01:06:15,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 01:06:15,669 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-11-07 01:06:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash -501616430, now seen corresponding path program 1 times [2021-11-07 01:06:15,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:15,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718630209] [2021-11-07 01:06:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:15,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:06:15,863 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:15,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718630209] [2021-11-07 01:06:15,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718630209] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:15,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:15,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 01:06:15,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061477081] [2021-11-07 01:06:15,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 01:06:15,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:06:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 01:06:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:06:15,866 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-11-07 01:06:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:16,481 INFO L93 Difference]: Finished difference Result 371 states and 408 transitions. [2021-11-07 01:06:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:06:16,483 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-11-07 01:06:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:16,485 INFO L225 Difference]: With dead ends: 371 [2021-11-07 01:06:16,486 INFO L226 Difference]: Without dead ends: 371 [2021-11-07 01:06:16,486 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:06:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-11-07 01:06:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 370. [2021-11-07 01:06:16,498 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-11-07 01:06:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 407 transitions. [2021-11-07 01:06:16,501 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 407 transitions. Word has length 26 [2021-11-07 01:06:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:16,502 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 407 transitions. [2021-11-07 01:06:16,502 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-11-07 01:06:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 407 transitions. [2021-11-07 01:06:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 01:06:16,504 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:16,504 INFO L513 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-11-07 01:06:16,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 01:06:16,505 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-11-07 01:06:16,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:16,505 INFO L85 PathProgramCache]: Analyzing trace with hash 510736344, now seen corresponding path program 1 times [2021-11-07 01:06:16,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:06:16,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306922332] [2021-11-07 01:06:16,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:16,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:06:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 01:06:16,847 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:06:16,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306922332] [2021-11-07 01:06:16,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306922332] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:06:16,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472213680] [2021-11-07 01:06:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:16,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:06:16,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:06:16,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:06:16,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:06:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:17,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-07 01:06:17,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:06:17,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-11-07 01:06:17,972 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-11-07 01:06:17,973 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-11-07 01:06:18,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:06:18,097 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-11-07 01:06:18,258 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-07 01:06:18,258 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-11-07 01:06:18,481 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-11-07 01:06:18,481 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-11-07 01:06:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:06:18,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:06:23,065 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-11-07 01:06:23,165 INFO L354 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2021-11-07 01:06:23,166 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-11-07 01:06:24,610 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-11-07 01:06:28,297 INFO L354 Elim1Store]: treesize reduction 5, result has 99.1 percent of original size [2021-11-07 01:06:28,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 360 treesize of output 847 [2021-11-07 01:07:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:07:38,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472213680] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:07:38,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1919219221] [2021-11-07 01:07:38,190 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-11-07 01:07:38,191 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:07:38,197 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:07:38,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:07:38,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2021-11-07 01:07:38,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188176262] [2021-11-07 01:07:38,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-07 01:07:38,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-07 01:07:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1417, Unknown=3, NotChecked=0, Total=1560 [2021-11-07 01:07:38,205 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-11-07 01:07:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:41,425 INFO L93 Difference]: Finished difference Result 372 states and 408 transitions. [2021-11-07 01:07:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:07:41,426 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-11-07 01:07:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:41,430 INFO L225 Difference]: With dead ends: 372 [2021-11-07 01:07:41,430 INFO L226 Difference]: Without dead ends: 372 [2021-11-07 01:07:41,432 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=415, Invalid=2234, Unknown=3, NotChecked=0, Total=2652 [2021-11-07 01:07:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-07 01:07:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 369. [2021-11-07 01:07:41,444 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-11-07 01:07:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 404 transitions. [2021-11-07 01:07:41,447 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 404 transitions. Word has length 37 [2021-11-07 01:07:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:41,448 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 404 transitions. [2021-11-07 01:07:41,448 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-11-07 01:07:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 404 transitions. [2021-11-07 01:07:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 01:07:41,450 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:41,450 INFO L513 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-11-07 01:07:41,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:07:41,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-07 01:07:41,664 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-11-07 01:07:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:41,664 INFO L85 PathProgramCache]: Analyzing trace with hash 510736345, now seen corresponding path program 1 times [2021-11-07 01:07:41,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:41,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007393199] [2021-11-07 01:07:41,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:41,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 01:07:42,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:42,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007393199] [2021-11-07 01:07:42,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007393199] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:07:42,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60003772] [2021-11-07 01:07:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:42,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:07:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:07:42,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:07:42,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:07:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:42,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-07 01:07:42,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:07:42,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 01:07:42,830 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-11-07 01:07:42,842 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-11-07 01:07:43,273 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-07 01:07:43,273 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-11-07 01:07:43,285 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-07 01:07:43,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2021-11-07 01:07:43,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:07:43,403 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-11-07 01:07:43,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:07:43,411 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-11-07 01:07:43,570 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-07 01:07:43,570 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-11-07 01:07:43,594 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-07 01:07:43,595 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-11-07 01:07:43,819 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-11-07 01:07:43,820 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-11-07 01:07:43,835 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-11-07 01:07:43,835 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-11-07 01:07:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:07:43,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:07:46,134 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-11-07 01:07:55,194 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-11-07 01:07:55,208 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-11-07 01:07:55,230 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:07:55,230 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-11-07 01:07:55,288 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-07 01:07:55,288 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-11-07 01:07:59,768 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-11-07 01:07:59,782 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-11-07 01:08:02,383 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-07 01:08:02,384 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 166 treesize of output 165 [2021-11-07 01:08:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2021-11-07 01:08:04,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60003772] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:08:04,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [995211960] [2021-11-07 01:08:04,198 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-11-07 01:08:04,198 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:08:04,198 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:08:04,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:08:04,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 40 [2021-11-07 01:08:04,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848737079] [2021-11-07 01:08:04,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-07 01:08:04,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:04,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-07 01:08:04,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1422, Unknown=6, NotChecked=76, Total=1640 [2021-11-07 01:08:04,202 INFO L87 Difference]: Start difference. First operand 369 states and 404 transitions. Second operand has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 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-11-07 01:08:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:09,791 INFO L93 Difference]: Finished difference Result 368 states and 403 transitions. [2021-11-07 01:08:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:08:09,800 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 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-11-07 01:08:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:09,803 INFO L225 Difference]: With dead ends: 368 [2021-11-07 01:08:09,803 INFO L226 Difference]: Without dead ends: 368 [2021-11-07 01:08:09,806 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=458, Invalid=2402, Unknown=6, NotChecked=104, Total=2970 [2021-11-07 01:08:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-11-07 01:08:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2021-11-07 01:08:09,817 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-11-07 01:08:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 403 transitions. [2021-11-07 01:08:09,820 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 403 transitions. Word has length 37 [2021-11-07 01:08:09,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:09,821 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 403 transitions. [2021-11-07 01:08:09,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 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-11-07 01:08:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 403 transitions. [2021-11-07 01:08:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 01:08:09,822 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:09,823 INFO L513 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-11-07 01:08:09,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:08:10,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-07 01:08:10,044 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-11-07 01:08:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1249289076, now seen corresponding path program 1 times [2021-11-07 01:08:10,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:10,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766784889] [2021-11-07 01:08:10,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:10,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:08:10,175 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:10,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766784889] [2021-11-07 01:08:10,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766784889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:10,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:10,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:10,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795344984] [2021-11-07 01:08:10,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:10,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:10,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:10,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:10,178 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-11-07 01:08:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:10,224 INFO L93 Difference]: Finished difference Result 357 states and 380 transitions. [2021-11-07 01:08:10,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:08:10,225 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-11-07 01:08:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:10,228 INFO L225 Difference]: With dead ends: 357 [2021-11-07 01:08:10,228 INFO L226 Difference]: Without dead ends: 357 [2021-11-07 01:08:10,229 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-11-07 01:08:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-11-07 01:08:10,239 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-11-07 01:08:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 380 transitions. [2021-11-07 01:08:10,241 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 380 transitions. Word has length 40 [2021-11-07 01:08:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:10,242 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 380 transitions. [2021-11-07 01:08:10,242 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-11-07 01:08:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 380 transitions. [2021-11-07 01:08:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 01:08:10,245 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:10,246 INFO L513 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-11-07 01:08:10,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 01:08:10,246 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-11-07 01:08:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:10,247 INFO L85 PathProgramCache]: Analyzing trace with hash 715579460, now seen corresponding path program 1 times [2021-11-07 01:08:10,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:10,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98872912] [2021-11-07 01:08:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:10,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 01:08:10,768 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:10,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98872912] [2021-11-07 01:08:10,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98872912] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:08:10,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787691244] [2021-11-07 01:08:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:10,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:08:10,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:08:10,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:08:10,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 01:08:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:11,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-07 01:08:11,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:08:11,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-07 01:08:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:08:27,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:08:54,687 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.base|] [2021-11-07 01:08:54,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [562628399] [2021-11-07 01:08:54,691 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2021-11-07 01:08:54,691 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:08:54,691 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:08:54,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:08:54,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-11-07 01:08:54,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550464044] [2021-11-07 01:08:54,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:08:54,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:08:54,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=615, Unknown=12, NotChecked=0, Total=702 [2021-11-07 01:08:54,696 INFO L87 Difference]: Start difference. First operand 357 states and 380 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-07 01:09:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:09:05,980 INFO L93 Difference]: Finished difference Result 360 states and 382 transitions. [2021-11-07 01:09:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:09:05,981 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-11-07 01:09:05,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:09:05,984 INFO L225 Difference]: With dead ends: 360 [2021-11-07 01:09:05,985 INFO L226 Difference]: Without dead ends: 357 [2021-11-07 01:09:05,986 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 52.9s TimeCoverageRelationStatistics Valid=171, Invalid=1218, Unknown=17, NotChecked=0, Total=1406 [2021-11-07 01:09:05,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-11-07 01:09:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-11-07 01:09:05,996 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-11-07 01:09:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 379 transitions. [2021-11-07 01:09:05,999 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 379 transitions. Word has length 46 [2021-11-07 01:09:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:09:05,999 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 379 transitions. [2021-11-07 01:09:06,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-07 01:09:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 379 transitions. [2021-11-07 01:09:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 01:09:06,001 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:09:06,001 INFO L513 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-11-07 01:09:06,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:09:06,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:09:06,224 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-11-07 01:09:06,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:09:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash -633747766, now seen corresponding path program 1 times [2021-11-07 01:09:06,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:09:06,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727539689] [2021-11-07 01:09:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:09:06,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:09:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:09:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:09:07,768 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:09:07,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727539689] [2021-11-07 01:09:07,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727539689] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:09:07,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761468854] [2021-11-07 01:09:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:09:07,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:09:07,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:09:07,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:09:07,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 01:09:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:09:08,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-07 01:09:08,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:09:08,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 01:09:08,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-07 01:09:08,601 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 01:09:08,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-11-07 01:09:09,136 INFO L354 Elim1Store]: treesize reduction 109, result has 18.0 percent of original size [2021-11-07 01:09:09,136 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-11-07 01:09:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:09:09,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:09:28,122 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_dll_insert_master_~item~1.base_BEFORE_CALL_2] [2021-11-07 01:09:28,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2131035360] [2021-11-07 01:09:28,125 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2021-11-07 01:09:28,125 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:09:28,126 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:09:28,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:09:28,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2021-11-07 01:09:28,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090177183] [2021-11-07 01:09:28,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-07 01:09:28,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:09:28,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-07 01:09:28,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1046, Unknown=8, NotChecked=0, Total=1190 [2021-11-07 01:09:28,135 INFO L87 Difference]: Start difference. First operand 357 states and 379 transitions. Second operand has 23 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 01:09:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:09:33,478 INFO L93 Difference]: Finished difference Result 379 states and 410 transitions. [2021-11-07 01:09:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-07 01:09:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 47 [2021-11-07 01:09:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:09:33,484 INFO L225 Difference]: With dead ends: 379 [2021-11-07 01:09:33,484 INFO L226 Difference]: Without dead ends: 379 [2021-11-07 01:09:33,485 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=263, Invalid=1985, Unknown=8, NotChecked=0, Total=2256 [2021-11-07 01:09:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-11-07 01:09:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 365. [2021-11-07 01:09:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 204 states have (on average 1.7794117647058822) internal successors, (363), 342 states have internal predecessors, (363), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (16), 13 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-07 01:09:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 391 transitions. [2021-11-07 01:09:33,500 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 391 transitions. Word has length 47 [2021-11-07 01:09:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:09:33,500 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 391 transitions. [2021-11-07 01:09:33,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 01:09:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 391 transitions. [2021-11-07 01:09:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 01:09:33,501 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:09:33,502 INFO L513 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-11-07 01:09:33,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 01:09:33,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:09:33,728 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting dll_insert_masterErr13REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-11-07 01:09:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:09:33,728 INFO L85 PathProgramCache]: Analyzing trace with hash -633747765, now seen corresponding path program 1 times [2021-11-07 01:09:33,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:09:33,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477360256] [2021-11-07 01:09:33,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:09:33,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:09:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:09:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:09:34,615 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:09:34,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477360256] [2021-11-07 01:09:34,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477360256] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:09:34,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749112861] [2021-11-07 01:09:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:09:34,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:09:34,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:09:34,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:09:34,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 01:09:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:09:35,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-07 01:09:35,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:09:35,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 01:09:35,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-07 01:09:35,854 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 01:09:35,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-11-07 01:09:36,746 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-07 01:09:36,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 60 [2021-11-07 01:09:36,757 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-11-07 01:09:36,757 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 60 treesize of output 52 [2021-11-07 01:09:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:09:36,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:09:40,798 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_dll_insert_master_~item~1.base_BEFORE_CALL_4 Int) (v_dll_insert_master_~item~1.offset_BEFORE_CALL_2 Int)) (or (and (<= 0 (+ v_dll_insert_master_~item~1.offset_BEFORE_CALL_2 8)) (<= (+ v_dll_insert_master_~item~1.offset_BEFORE_CALL_2 12) (select |c_#length| v_dll_insert_master_~item~1.base_BEFORE_CALL_4))) (exists ((|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_66| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_93| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_94| Int)) (let ((.cse0 (store |c_old(#valid)| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_66| 1))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_93|) 0) (< (+ |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_93| 1) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_66|) (= (select (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_93| 1) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_94|) 0) (= (select |c_old(#valid)| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_66|) 0) (or (< (+ v_dll_insert_master_~item~1.offset_BEFORE_CALL_2 8) 0) (< (select (store (store (store |c_old(#length)| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_66| 4) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_93| 8) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_94| 8) v_dll_insert_master_~item~1.base_BEFORE_CALL_4) (+ v_dll_insert_master_~item~1.offset_BEFORE_CALL_2 12)))))))) is different from false [2021-11-07 01:09:48,425 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_dll_insert_master_~item~1.base_BEFORE_CALL_4, v_dll_insert_master_~item~1.offset_BEFORE_CALL_2] [2021-11-07 01:09:48,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1969468975] [2021-11-07 01:09:48,428 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2021-11-07 01:09:48,428 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:09:48,429 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:09:48,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:09:48,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-11-07 01:09:48,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108680996] [2021-11-07 01:09:48,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 01:09:48,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:09:48,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 01:09:48,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=693, Unknown=2, NotChecked=54, Total=870 [2021-11-07 01:09:48,434 INFO L87 Difference]: Start difference. First operand 365 states and 391 transitions. Second operand has 14 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 01:09:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:09:49,768 INFO L93 Difference]: Finished difference Result 372 states and 400 transitions. [2021-11-07 01:09:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 01:09:49,769 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 47 [2021-11-07 01:09:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:09:49,771 INFO L225 Difference]: With dead ends: 372 [2021-11-07 01:09:49,771 INFO L226 Difference]: Without dead ends: 372 [2021-11-07 01:09:49,771 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=142, Invalid=790, Unknown=2, NotChecked=58, Total=992 [2021-11-07 01:09:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-07 01:09:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 365. [2021-11-07 01:09:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 204 states have (on average 1.7696078431372548) internal successors, (361), 342 states have internal predecessors, (361), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (16), 13 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-07 01:09:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 389 transitions. [2021-11-07 01:09:49,782 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 389 transitions. Word has length 47 [2021-11-07 01:09:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:09:49,783 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 389 transitions. [2021-11-07 01:09:49,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 01:09:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 389 transitions. [2021-11-07 01:09:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-07 01:09:49,784 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:09:49,784 INFO L513 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, 1] [2021-11-07 01:09:49,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-07 01:09:50,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-07 01:09:50,012 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting dll_insert_masterErr14REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-11-07 01:09:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:09:50,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1828683257, now seen corresponding path program 1 times [2021-11-07 01:09:50,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:09:50,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508864399] [2021-11-07 01:09:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:09:50,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:09:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:09:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-07 01:09:50,953 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:09:50,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508864399] [2021-11-07 01:09:50,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508864399] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:09:50,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506546438] [2021-11-07 01:09:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:09:50,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:09:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:09:50,962 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:09:50,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 01:09:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:09:51,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-07 01:09:51,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:09:51,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-07 01:09:52,021 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 01:09:52,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-11-07 01:09:52,780 INFO L354 Elim1Store]: treesize reduction 133, result has 15.3 percent of original size [2021-11-07 01:09:52,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 53 treesize of output 58 [2021-11-07 01:09:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:09:52,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:09:55,718 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_dll_insert_master_~dll.base_BEFORE_CALL_2 Int)) (or (exists ((|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_87| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res.base_104| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res.base_105| Int)) (let ((.cse1 (store |c_old(#valid)| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_87| 1))) (let ((.cse0 (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res.base_104| 1))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res.base_105|) 0) (< (+ |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res.base_104| 1) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_87|) (= (select |c_old(#valid)| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_87|) 0) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res.base_104|) 0) (not (= (select (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res.base_105| 1) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_87| 0) v_dll_insert_master_~dll.base_BEFORE_CALL_2) 1)))))) (= (select |c_#valid| v_dll_insert_master_~dll.base_BEFORE_CALL_2) 1))) is different from false [2021-11-07 01:09:58,836 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_dll_insert_master_~dll.base_BEFORE_CALL_2] [2021-11-07 01:09:58,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1446691535] [2021-11-07 01:09:58,839 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2021-11-07 01:09:58,839 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:09:58,840 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:09:58,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:09:58,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-11-07 01:09:58,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224130025] [2021-11-07 01:09:58,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 01:09:58,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:09:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 01:09:58,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=758, Unknown=2, NotChecked=56, Total=930 [2021-11-07 01:09:58,844 INFO L87 Difference]: Start difference. First operand 365 states and 389 transitions. Second operand has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 01:10:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:10:00,880 INFO L93 Difference]: Finished difference Result 369 states and 395 transitions. [2021-11-07 01:10:00,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:10:00,881 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2021-11-07 01:10:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:10:00,884 INFO L225 Difference]: With dead ends: 369 [2021-11-07 01:10:00,884 INFO L226 Difference]: Without dead ends: 369 [2021-11-07 01:10:00,885 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=205, Invalid=1519, Unknown=2, NotChecked=80, Total=1806 [2021-11-07 01:10:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-11-07 01:10:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2021-11-07 01:10:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 206 states have (on average 1.7718446601941749) internal successors, (365), 344 states have internal predecessors, (365), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (16), 13 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-07 01:10:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 393 transitions. [2021-11-07 01:10:00,896 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 393 transitions. Word has length 48 [2021-11-07 01:10:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:10:00,896 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 393 transitions. [2021-11-07 01:10:00,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 01:10:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 393 transitions. [2021-11-07 01:10:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-07 01:10:00,897 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:10:00,898 INFO L513 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, 1] [2021-11-07 01:10:00,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-07 01:10:01,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:10:01,120 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting dll_insert_masterErr15REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-11-07 01:10:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:10:01,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1828683258, now seen corresponding path program 1 times [2021-11-07 01:10:01,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:10:01,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795015091] [2021-11-07 01:10:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:10:01,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:10:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:10:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:10:03,247 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:10:03,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795015091] [2021-11-07 01:10:03,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795015091] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:10:03,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979726302] [2021-11-07 01:10:03,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:10:03,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:10:03,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:10:03,251 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:10:03,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 01:10:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:10:03,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-07 01:10:03,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:10:04,233 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 14 treesize of output 12 [2021-11-07 01:10:04,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-07 01:10:04,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-07 01:10:04,680 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 01:10:04,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-11-07 01:10:05,406 INFO L354 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2021-11-07 01:10:05,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 64 [2021-11-07 01:10:05,421 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-07 01:10:05,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 60 [2021-11-07 01:10:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:10:05,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:10:09,489 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_dll_insert_master_~dll.base_BEFORE_CALL_4 Int) (v_dll_insert_master_~dll.offset_BEFORE_CALL_2 Int)) (or (exists ((|v_dll_create_generic_~#dll~0.base_88| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_140| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_141| Int)) (and (or (< (select (store (store (store |c_old(#length)| |v_dll_create_generic_~#dll~0.base_88| 4) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_140| 8) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_141| 8) v_dll_insert_master_~dll.base_BEFORE_CALL_4) (+ v_dll_insert_master_~dll.offset_BEFORE_CALL_2 4)) (< v_dll_insert_master_~dll.offset_BEFORE_CALL_2 0)) (= (select (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_88| 1) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_140|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_140| |c_#StackHeapBarrier|) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_141| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_88|) 0) (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_88|))) (and (<= (+ v_dll_insert_master_~dll.offset_BEFORE_CALL_2 4) (select |c_#length| v_dll_insert_master_~dll.base_BEFORE_CALL_4)) (<= 0 v_dll_insert_master_~dll.offset_BEFORE_CALL_2)))) is different from false [2021-11-07 01:10:17,117 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_dll_insert_master_~dll.base_BEFORE_CALL_4, v_dll_insert_master_~dll.offset_BEFORE_CALL_2] [2021-11-07 01:10:17,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2045676984] [2021-11-07 01:10:17,119 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2021-11-07 01:10:17,119 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:10:17,120 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:10:17,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:10:17,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2021-11-07 01:10:17,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508476568] [2021-11-07 01:10:17,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-07 01:10:17,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:10:17,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-07 01:10:17,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1639, Unknown=2, NotChecked=82, Total=1892 [2021-11-07 01:10:17,125 INFO L87 Difference]: Start difference. First operand 367 states and 393 transitions. Second operand has 28 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 01:10:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:10:22,542 INFO L93 Difference]: Finished difference Result 372 states and 401 transitions. [2021-11-07 01:10:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:10:22,543 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2021-11-07 01:10:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:10:22,547 INFO L225 Difference]: With dead ends: 372 [2021-11-07 01:10:22,547 INFO L226 Difference]: Without dead ends: 372 [2021-11-07 01:10:22,549 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=316, Invalid=2548, Unknown=2, NotChecked=104, Total=2970 [2021-11-07 01:10:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-07 01:10:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2021-11-07 01:10:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 208 states have (on average 1.7644230769230769) internal successors, (367), 347 states have internal predecessors, (367), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (19), 14 states have call predecessors, (19), 13 states have call successors, (19) [2021-11-07 01:10:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 399 transitions. [2021-11-07 01:10:22,563 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 399 transitions. Word has length 48 [2021-11-07 01:10:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:10:22,564 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 399 transitions. [2021-11-07 01:10:22,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 01:10:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 399 transitions. [2021-11-07 01:10:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-07 01:10:22,565 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:10:22,565 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:10:22,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-07 01:10:22,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:10:22,792 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting dll_insert_masterErr6REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-11-07 01:10:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:10:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1909332211, now seen corresponding path program 1 times [2021-11-07 01:10:22,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:10:22,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203097030] [2021-11-07 01:10:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:10:22,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:10:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:10:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-07 01:10:23,003 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:10:23,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203097030] [2021-11-07 01:10:23,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203097030] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:10:23,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310775260] [2021-11-07 01:10:23,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:10:23,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:10:23,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:10:23,010 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:10:23,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-07 01:10:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:10:23,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-07 01:10:23,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:10:24,038 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-07 01:10:24,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2021-11-07 01:10:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-07 01:10:24,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:10:32,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_dll_insert_master_alloc_or_die_master_~ptr~1.base_21 Int)) (or (<= |c_#StackHeapBarrier| v_dll_insert_master_alloc_or_die_master_~ptr~1.base_21) (= (select (store |c_#valid| v_dll_insert_master_alloc_or_die_master_~ptr~1.base_21 1) |c_##fun~$Pointer$~TO~VOID_#~12.base|) 1))) is different from false [2021-11-07 01:10:44,487 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 23 treesize of output 19 [2021-11-07 01:10:44,584 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-07 01:10:44,584 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 23 treesize of output 22 [2021-11-07 01:10:44,621 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-07 01:10:44,621 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 23 treesize of output 22 [2021-11-07 01:10:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 2 not checked. [2021-11-07 01:10:44,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310775260] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:10:44,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [872094596] [2021-11-07 01:10:44,782 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2021-11-07 01:10:44,782 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:10:44,782 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:10:44,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:10:44,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 19 [2021-11-07 01:10:44,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464774533] [2021-11-07 01:10:44,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-07 01:10:44,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:10:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-07 01:10:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=285, Unknown=10, NotChecked=34, Total=380 [2021-11-07 01:10:44,785 INFO L87 Difference]: Start difference. First operand 371 states and 399 transitions. Second operand has 20 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 10 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-07 01:10:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:10:46,246 INFO L93 Difference]: Finished difference Result 369 states and 397 transitions. [2021-11-07 01:10:46,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 01:10:46,247 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 10 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 60 [2021-11-07 01:10:46,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:10:46,249 INFO L225 Difference]: With dead ends: 369 [2021-11-07 01:10:46,249 INFO L226 Difference]: Without dead ends: 369 [2021-11-07 01:10:46,249 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=86, Invalid=414, Unknown=10, NotChecked=42, Total=552 [2021-11-07 01:10:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-11-07 01:10:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2021-11-07 01:10:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 208 states have (on average 1.7548076923076923) internal successors, (365), 345 states have internal predecessors, (365), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (19), 14 states have call predecessors, (19), 13 states have call successors, (19) [2021-11-07 01:10:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 397 transitions. [2021-11-07 01:10:46,262 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 397 transitions. Word has length 60 [2021-11-07 01:10:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:10:46,263 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 397 transitions. [2021-11-07 01:10:46,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 10 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-07 01:10:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 397 transitions. [2021-11-07 01:10:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-07 01:10:46,264 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:10:46,264 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:10:46,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-07 01:10:46,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-07 01:10:46,488 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting dll_insert_masterErr7REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-11-07 01:10:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:10:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1909332210, now seen corresponding path program 1 times [2021-11-07 01:10:46,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:10:46,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742628628] [2021-11-07 01:10:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:10:46,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:10:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:10:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-07 01:10:46,800 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:10:46,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742628628] [2021-11-07 01:10:46,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742628628] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:10:46,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217219476] [2021-11-07 01:10:46,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:10:46,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:10:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:10:46,802 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:10:46,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-07 01:10:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:10:47,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-07 01:10:47,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:10:48,056 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-07 01:10:48,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2021-11-07 01:10:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-07 01:10:48,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:10:52,818 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 33 treesize of output 29 [2021-11-07 01:10:55,024 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-07 01:10:55,024 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 22 treesize of output 21 [2021-11-07 01:10:57,137 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:10:57,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2021-11-07 01:10:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-07 01:10:57,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217219476] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:10:57,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1617495639] [2021-11-07 01:10:57,308 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2021-11-07 01:10:57,308 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:10:57,309 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:10:57,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:10:57,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 29 [2021-11-07 01:10:57,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171379463] [2021-11-07 01:10:57,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-07 01:10:57,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:10:57,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-07 01:10:57,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=777, Unknown=4, NotChecked=0, Total=870 [2021-11-07 01:10:57,312 INFO L87 Difference]: Start difference. First operand 369 states and 397 transitions. Second operand has 30 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2021-11-07 01:10:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:10:59,157 INFO L93 Difference]: Finished difference Result 367 states and 395 transitions. [2021-11-07 01:10:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:10:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 60 [2021-11-07 01:10:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:10:59,160 INFO L225 Difference]: With dead ends: 367 [2021-11-07 01:10:59,160 INFO L226 Difference]: Without dead ends: 367 [2021-11-07 01:10:59,161 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=158, Invalid=1170, Unknown=4, NotChecked=0, Total=1332 [2021-11-07 01:10:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-11-07 01:10:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2021-11-07 01:10:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 208 states have (on average 1.7451923076923077) internal successors, (363), 343 states have internal predecessors, (363), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (19), 14 states have call predecessors, (19), 13 states have call successors, (19) [2021-11-07 01:10:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 395 transitions. [2021-11-07 01:10:59,187 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 395 transitions. Word has length 60 [2021-11-07 01:10:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:10:59,187 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 395 transitions. [2021-11-07 01:10:59,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2021-11-07 01:10:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 395 transitions. [2021-11-07 01:10:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-07 01:10:59,190 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:10:59,190 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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-11-07 01:10:59,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-07 01:10:59,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-07 01:10:59,416 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting dll_insert_masterErr12REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-11-07 01:10:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:10:59,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1313347363, now seen corresponding path program 1 times [2021-11-07 01:10:59,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:10:59,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854820955] [2021-11-07 01:10:59,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:10:59,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:10:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:11:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 01:11:01,906 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:11:01,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854820955] [2021-11-07 01:11:01,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854820955] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:11:01,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849257969] [2021-11-07 01:11:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:11:01,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:11:01,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:11:01,907 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:11:01,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-07 01:11:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:11:02,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 92 conjunts are in the unsatisfiable core [2021-11-07 01:11:02,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:11:02,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 01:11:02,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-07 01:11:03,340 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 16 treesize of output 14 [2021-11-07 01:11:03,585 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 18 treesize of output 14 [2021-11-07 01:11:03,832 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 16 treesize of output 14 [2021-11-07 01:11:19,835 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 66 treesize of output 58 [2021-11-07 01:11:20,473 INFO L354 Elim1Store]: treesize reduction 164, result has 15.0 percent of original size [2021-11-07 01:11:20,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 59 [2021-11-07 01:11:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:11:20,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:12:52,157 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_dll_insert_master_~item~1.base_BEFORE_CALL_6] [2021-11-07 01:12:52,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [963180979] [2021-11-07 01:12:52,159 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2021-11-07 01:12:52,159 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:12:52,159 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:12:52,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:12:52,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2021-11-07 01:12:52,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30145439] [2021-11-07 01:12:52,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-07 01:12:52,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:12:52,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-07 01:12:52,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2518, Unknown=39, NotChecked=0, Total=2756 [2021-11-07 01:12:52,162 INFO L87 Difference]: Start difference. First operand 367 states and 395 transitions. Second operand has 30 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-07 01:13:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:13,546 INFO L93 Difference]: Finished difference Result 390 states and 429 transitions. [2021-11-07 01:13:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 01:13:13,547 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 61 [2021-11-07 01:13:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:13,549 INFO L225 Difference]: With dead ends: 390 [2021-11-07 01:13:13,549 INFO L226 Difference]: Without dead ends: 390 [2021-11-07 01:13:13,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 125.5s TimeCoverageRelationStatistics Valid=332, Invalid=4045, Unknown=45, NotChecked=0, Total=4422 [2021-11-07 01:13:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-07 01:13:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 376. [2021-11-07 01:13:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 214 states have (on average 1.7383177570093458) internal successors, (372), 348 states have internal predecessors, (372), 14 states have call successors, (14), 9 states have call predecessors, (14), 13 states have return successors, (24), 18 states have call predecessors, (24), 14 states have call successors, (24) [2021-11-07 01:13:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 410 transitions. [2021-11-07 01:13:13,559 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 410 transitions. Word has length 61 [2021-11-07 01:13:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:13,560 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 410 transitions. [2021-11-07 01:13:13,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-07 01:13:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 410 transitions. [2021-11-07 01:13:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-07 01:13:13,561 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:13,561 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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-11-07 01:13:13,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-07 01:13:13,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:13:13,780 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting dll_insert_masterErr13REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-11-07 01:13:13,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1313347364, now seen corresponding path program 1 times [2021-11-07 01:13:13,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:13,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17967372] [2021-11-07 01:13:13,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:13,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-07 01:13:14,966 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:14,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17967372] [2021-11-07 01:13:14,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17967372] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:13:14,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768551021] [2021-11-07 01:13:14,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:14,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:13:14,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:13:14,967 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:13:14,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-07 01:13:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:15,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 98 conjunts are in the unsatisfiable core [2021-11-07 01:13:15,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:13:15,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 01:13:15,954 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 14 treesize of output 12 [2021-11-07 01:13:15,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-07 01:13:16,378 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 13 treesize of output 11 [2021-11-07 01:13:16,834 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 01:13:16,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2021-11-07 01:13:17,689 INFO L354 Elim1Store]: treesize reduction 164, result has 11.4 percent of original size [2021-11-07 01:13:17,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 74 [2021-11-07 01:13:17,698 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-11-07 01:13:17,699 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 77 treesize of output 69 [2021-11-07 01:13:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-07 01:13:17,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:13:23,011 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_dll_insert_master_~item~1.base_BEFORE_CALL_8 Int) (v_dll_insert_master_~item~1.offset_BEFORE_CALL_4 Int)) (or (and (<= 0 (+ v_dll_insert_master_~item~1.offset_BEFORE_CALL_4 8)) (<= (+ v_dll_insert_master_~item~1.offset_BEFORE_CALL_4 12) (select |c_#length| v_dll_insert_master_~item~1.base_BEFORE_CALL_8))) (exists ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_278| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_277| Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_208| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_279| Int)) (let ((.cse1 (store |c_old(#valid)| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_208| 1))) (let ((.cse0 (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_279| 1))) (and (< |c_#StackHeapBarrier| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_208|) (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_277|) 0) (= 0 (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_279|)) (= (select (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_277| 1) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_278|) 0) (or (< (+ v_dll_insert_master_~item~1.offset_BEFORE_CALL_4 8) 0) (< (select (store (store (store (store |c_old(#length)| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base_208| 4) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_279| 8) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_277| 8) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base_278| 8) v_dll_insert_master_~item~1.base_BEFORE_CALL_8) (+ v_dll_insert_master_~item~1.offset_BEFORE_CALL_4 12))))))))) is different from false [2021-11-07 01:13:48,999 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_dll_insert_master_~item~1.base_BEFORE_CALL_8, v_dll_insert_master_~item~1.offset_BEFORE_CALL_4] [2021-11-07 01:13:48,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1954831119] [2021-11-07 01:13:49,001 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2021-11-07 01:13:49,001 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:13:49,002 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:13:49,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:13:49,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-11-07 01:13:49,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444462531] [2021-11-07 01:13:49,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:13:49,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:13:49,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1104, Unknown=8, NotChecked=68, Total=1332 [2021-11-07 01:13:49,005 INFO L87 Difference]: Start difference. First operand 376 states and 410 transitions. Second operand has 15 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-07 01:13:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:52,516 INFO L93 Difference]: Finished difference Result 383 states and 419 transitions. [2021-11-07 01:13:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:13:52,517 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 61 [2021-11-07 01:13:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:52,519 INFO L225 Difference]: With dead ends: 383 [2021-11-07 01:13:52,519 INFO L226 Difference]: Without dead ends: 383 [2021-11-07 01:13:52,520 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=168, Invalid=1234, Unknown=8, NotChecked=72, Total=1482 [2021-11-07 01:13:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-11-07 01:13:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 376. [2021-11-07 01:13:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 214 states have (on average 1.7289719626168225) internal successors, (370), 348 states have internal predecessors, (370), 14 states have call successors, (14), 9 states have call predecessors, (14), 13 states have return successors, (24), 18 states have call predecessors, (24), 14 states have call successors, (24) [2021-11-07 01:13:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 408 transitions. [2021-11-07 01:13:52,530 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 408 transitions. Word has length 61 [2021-11-07 01:13:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:52,531 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 408 transitions. [2021-11-07 01:13:52,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-07 01:13:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 408 transitions. [2021-11-07 01:13:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-07 01:13:52,532 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:52,532 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:13:52,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-07 01:13:52,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-07 01:13:52,748 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting dll_insert_masterErr10REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-11-07 01:13:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1658060432, now seen corresponding path program 1 times [2021-11-07 01:13:52,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:52,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750856413] [2021-11-07 01:13:52,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:52,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-07 01:13:53,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:53,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750856413] [2021-11-07 01:13:53,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750856413] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:13:53,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027711331] [2021-11-07 01:13:53,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:53,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:13:53,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:13:53,171 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:13:53,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64de6867-bf37-4ba8-a941-54d0f203016d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-07 01:13:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:54,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-07 01:13:54,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:13:54,483 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 17 treesize of output 13 [2021-11-07 01:13:54,784 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-07 01:13:54,784 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 22 treesize of output 24 [2021-11-07 01:13:54,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:13:54,866 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 27 treesize of output 26 [2021-11-07 01:13:54,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:13:54,966 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-07 01:13:54,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2021-11-07 01:13:55,090 INFO L354 Elim1Store]: treesize reduction 110, result has 17.9 percent of original size [2021-11-07 01:13:55,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 60 [2021-11-07 01:13:57,234 INFO L354 Elim1Store]: treesize reduction 118, result has 2.5 percent of original size [2021-11-07 01:13:57,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 40 [2021-11-07 01:13:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-07 01:13:57,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:14:04,474 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 1697 treesize of output 1681 [2021-11-07 01:14:04,536 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:14:04,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2065 treesize of output 1959 [2021-11-07 01:17:10,454 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 933 treesize of output 925 [2021-11-07 01:17:10,496 INFO L354 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2021-11-07 01:17:10,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1117 treesize of output 1070