./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 14:06:19,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:06:19,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:06:19,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:06:19,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:06:19,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:06:19,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:06:19,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:06:19,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:06:19,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:06:19,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:06:19,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:06:19,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:06:19,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:06:19,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:06:19,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:06:19,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:06:19,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:06:19,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:06:19,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:06:19,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:06:19,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:06:19,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:06:19,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:06:19,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:06:19,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:06:19,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:06:19,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:06:19,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:06:19,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:06:19,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:06:19,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:06:19,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:06:19,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:06:19,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:06:19,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:06:19,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:06:19,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:06:19,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:06:19,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:06:19,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:06:19,560 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 14:06:19,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:06:19,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:06:19,605 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:06:19,605 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:06:19,606 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:06:19,607 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:06:19,607 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:06:19,607 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:06:19,608 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:06:19,608 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:06:19,609 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:06:19,610 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:06:19,610 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:06:19,610 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:06:19,610 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:06:19,611 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:06:19,611 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:06:19,611 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:06:19,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:06:19,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:06:19,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:06:19,613 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:06:19,613 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:06:19,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:06:19,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:06:19,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:06:19,614 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:06:19,615 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:06:19,615 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:06:19,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:06:19,616 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:06:19,616 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:06:19,616 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:06:19,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:06:19,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:06:19,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:06:19,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:06:19,618 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:06:19,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:06:19,618 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:06:19,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:06:19,619 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:06:19,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/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_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 [2022-11-23 14:06:20,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:06:20,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:06:20,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:06:20,049 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:06:20,050 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:06:20,052 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2022-11-23 14:06:23,175 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:06:23,472 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:06:23,475 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2022-11-23 14:06:23,487 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/data/f5a8f0264/5bf40e7d024340a586fd899dcbc3ded1/FLAG7eac61213 [2022-11-23 14:06:23,510 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/data/f5a8f0264/5bf40e7d024340a586fd899dcbc3ded1 [2022-11-23 14:06:23,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:06:23,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:06:23,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:06:23,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:06:23,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:06:23,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:06:23" (1/1) ... [2022-11-23 14:06:23,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653e8a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:23, skipping insertion in model container [2022-11-23 14:06:23,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:06:23" (1/1) ... [2022-11-23 14:06:23,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:06:23,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:06:23,909 WARN L237 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_e4398528-2e78-4880-aab4-ca56c66e87ce/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i[22634,22647] [2022-11-23 14:06:23,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:06:24,007 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:06:24,048 WARN L237 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_e4398528-2e78-4880-aab4-ca56c66e87ce/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i[22634,22647] [2022-11-23 14:06:24,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:06:24,126 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:06:24,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24 WrapperNode [2022-11-23 14:06:24,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:06:24,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:06:24,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:06:24,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:06:24,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,194 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 234 [2022-11-23 14:06:24,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:06:24,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:06:24,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:06:24,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:06:24,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,239 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:06:24,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:06:24,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:06:24,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:06:24,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (1/1) ... [2022-11-23 14:06:24,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:06:24,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:24,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:06:24,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:06:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-11-23 14:06:24,333 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-11-23 14:06:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2022-11-23 14:06:24,333 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2022-11-23 14:06:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:06:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:06:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2022-11-23 14:06:24,334 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2022-11-23 14:06:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:06:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 14:06:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-23 14:06:24,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-23 14:06:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 14:06:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:06:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 14:06:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2022-11-23 14:06:24,336 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2022-11-23 14:06:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2022-11-23 14:06:24,336 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2022-11-23 14:06:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:06:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:06:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:06:24,510 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:06:24,513 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:06:25,427 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:06:25,505 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:06:25,515 INFO L300 CfgBuilder]: Removed 38 assume(true) statements. [2022-11-23 14:06:25,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:06:25 BoogieIcfgContainer [2022-11-23 14:06:25,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:06:25,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:06:25,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:06:25,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:06:25,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:06:23" (1/3) ... [2022-11-23 14:06:25,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683cc22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:06:25, skipping insertion in model container [2022-11-23 14:06:25,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:24" (2/3) ... [2022-11-23 14:06:25,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683cc22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:06:25, skipping insertion in model container [2022-11-23 14:06:25,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:06:25" (3/3) ... [2022-11-23 14:06:25,536 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2022-11-23 14:06:25,564 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:06:25,564 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2022-11-23 14:06:25,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:06:25,649 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a69bbec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:06:25,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2022-11-23 14:06:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 103 states have (on average 2.495145631067961) internal successors, (257), 220 states have internal predecessors, (257), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-23 14:06:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 14:06:25,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:25,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:25,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash 691826204, now seen corresponding path program 1 times [2022-11-23 14:06:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:25,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046061820] [2022-11-23 14:06:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:25,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:06:26,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:26,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046061820] [2022-11-23 14:06:26,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046061820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:26,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:26,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:06:26,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938733298] [2022-11-23 14:06:26,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:26,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:06:26,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:26,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:06:26,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:06:26,137 INFO L87 Difference]: Start difference. First operand has 232 states, 103 states have (on average 2.495145631067961) internal successors, (257), 220 states have internal predecessors, (257), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) 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) [2022-11-23 14:06:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:26,480 INFO L93 Difference]: Finished difference Result 231 states and 263 transitions. [2022-11-23 14:06:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:06:26,487 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 [2022-11-23 14:06:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:26,509 INFO L225 Difference]: With dead ends: 231 [2022-11-23 14:06:26,509 INFO L226 Difference]: Without dead ends: 230 [2022-11-23 14:06:26,511 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:26,519 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 19 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:26,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 355 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:06:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-23 14:06:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-11-23 14:06:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 103 states have (on average 2.174757281553398) internal successors, (224), 216 states have internal predecessors, (224), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-23 14:06:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 258 transitions. [2022-11-23 14:06:26,634 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 258 transitions. Word has length 7 [2022-11-23 14:06:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:26,634 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 258 transitions. [2022-11-23 14:06:26,635 INFO L496 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) [2022-11-23 14:06:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 258 transitions. [2022-11-23 14:06:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 14:06:26,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:26,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:26,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:06:26,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:26,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:26,640 INFO L85 PathProgramCache]: Analyzing trace with hash 691826205, now seen corresponding path program 1 times [2022-11-23 14:06:26,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:26,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703317530] [2022-11-23 14:06:26,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:26,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:06:26,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:26,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703317530] [2022-11-23 14:06:26,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703317530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:26,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:26,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:06:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669800864] [2022-11-23 14:06:26,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:26,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:06:26,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:26,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:06:26,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:06:26,831 INFO L87 Difference]: Start difference. First operand 228 states and 258 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) [2022-11-23 14:06:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:27,124 INFO L93 Difference]: Finished difference Result 228 states and 260 transitions. [2022-11-23 14:06:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:06:27,125 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 [2022-11-23 14:06:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:27,127 INFO L225 Difference]: With dead ends: 228 [2022-11-23 14:06:27,128 INFO L226 Difference]: Without dead ends: 228 [2022-11-23 14:06:27,128 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:27,130 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 17 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:27,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 360 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:06:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-23 14:06:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2022-11-23 14:06:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 103 states have (on average 2.1553398058252426) internal successors, (222), 214 states have internal predecessors, (222), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-23 14:06:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 256 transitions. [2022-11-23 14:06:27,147 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 256 transitions. Word has length 7 [2022-11-23 14:06:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:27,148 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 256 transitions. [2022-11-23 14:06:27,148 INFO L496 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) [2022-11-23 14:06:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 256 transitions. [2022-11-23 14:06:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:06:27,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:27,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:27,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:06:27,151 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:27,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash -892161265, now seen corresponding path program 1 times [2022-11-23 14:06:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:27,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283980729] [2022-11-23 14:06:27,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:06:27,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:27,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283980729] [2022-11-23 14:06:27,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283980729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:27,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:27,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:06:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348351640] [2022-11-23 14:06:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:27,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:06:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:27,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:06:27,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:06:27,242 INFO L87 Difference]: Start difference. First operand 226 states and 256 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) [2022-11-23 14:06:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:27,491 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2022-11-23 14:06:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:06:27,492 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 [2022-11-23 14:06:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:27,495 INFO L225 Difference]: With dead ends: 223 [2022-11-23 14:06:27,495 INFO L226 Difference]: Without dead ends: 223 [2022-11-23 14:06:27,499 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:27,506 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 17 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:27,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 346 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:06:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-23 14:06:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-11-23 14:06:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 103 states have (on average 2.1262135922330097) internal successors, (219), 211 states have internal predecessors, (219), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-23 14:06:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-11-23 14:06:27,539 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 9 [2022-11-23 14:06:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:27,540 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-11-23 14:06:27,540 INFO L496 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) [2022-11-23 14:06:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-11-23 14:06:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:06:27,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:27,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:27,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:06:27,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash -892161264, now seen corresponding path program 1 times [2022-11-23 14:06:27,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:27,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525480495] [2022-11-23 14:06:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:06:27,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:27,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525480495] [2022-11-23 14:06:27,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525480495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:27,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:27,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:06:27,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305479478] [2022-11-23 14:06:27,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:27,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:06:27,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:27,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:06:27,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:06:27,758 INFO L87 Difference]: Start difference. First operand 223 states and 253 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) [2022-11-23 14:06:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:27,992 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-11-23 14:06:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:06:27,993 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 [2022-11-23 14:06:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:27,995 INFO L225 Difference]: With dead ends: 220 [2022-11-23 14:06:27,995 INFO L226 Difference]: Without dead ends: 220 [2022-11-23 14:06:27,996 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:27,997 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 14 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:27,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 351 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:06:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-23 14:06:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-23 14:06:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 103 states have (on average 2.0970873786407767) internal successors, (216), 208 states have internal predecessors, (216), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-23 14:06:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 250 transitions. [2022-11-23 14:06:28,011 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 250 transitions. Word has length 9 [2022-11-23 14:06:28,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:28,011 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 250 transitions. [2022-11-23 14:06:28,011 INFO L496 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) [2022-11-23 14:06:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 250 transitions. [2022-11-23 14:06:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:06:28,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:28,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:28,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:06:28,013 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:28,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:28,014 INFO L85 PathProgramCache]: Analyzing trace with hash -874929520, now seen corresponding path program 1 times [2022-11-23 14:06:28,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:28,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668330799] [2022-11-23 14:06:28,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:28,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:06:28,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:28,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668330799] [2022-11-23 14:06:28,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668330799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:28,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:28,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:06:28,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395724570] [2022-11-23 14:06:28,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:28,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:06:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:28,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:06:28,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:06:28,219 INFO L87 Difference]: Start difference. First operand 220 states and 250 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) [2022-11-23 14:06:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:28,446 INFO L93 Difference]: Finished difference Result 242 states and 280 transitions. [2022-11-23 14:06:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:06:28,447 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 [2022-11-23 14:06:28,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:28,449 INFO L225 Difference]: With dead ends: 242 [2022-11-23 14:06:28,449 INFO L226 Difference]: Without dead ends: 242 [2022-11-23 14:06:28,449 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:28,452 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 15 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:28,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 867 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:06:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-23 14:06:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2022-11-23 14:06:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 112 states have (on average 2.044642857142857) internal successors, (229), 217 states have internal predecessors, (229), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2022-11-23 14:06:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 276 transitions. [2022-11-23 14:06:28,470 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 276 transitions. Word has length 9 [2022-11-23 14:06:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:28,471 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 276 transitions. [2022-11-23 14:06:28,471 INFO L496 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) [2022-11-23 14:06:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 276 transitions. [2022-11-23 14:06:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 14:06:28,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:28,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:28,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:06:28,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1118615216, now seen corresponding path program 1 times [2022-11-23 14:06:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:28,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289219171] [2022-11-23 14:06:28,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:06:28,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:28,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289219171] [2022-11-23 14:06:28,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289219171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:28,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:28,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 14:06:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863077358] [2022-11-23 14:06:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:28,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:06:28,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:28,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:06:28,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:06:28,753 INFO L87 Difference]: Start difference. First operand 236 states and 276 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) [2022-11-23 14:06:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:29,218 INFO L93 Difference]: Finished difference Result 255 states and 298 transitions. [2022-11-23 14:06:29,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:06:29,218 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 [2022-11-23 14:06:29,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:29,220 INFO L225 Difference]: With dead ends: 255 [2022-11-23 14:06:29,220 INFO L226 Difference]: Without dead ends: 255 [2022-11-23 14:06:29,220 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:29,221 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 92 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:29,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 866 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:06:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-23 14:06:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2022-11-23 14:06:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 120 states have (on average 1.9916666666666667) internal successors, (239), 224 states have internal predecessors, (239), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-23 14:06:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 288 transitions. [2022-11-23 14:06:29,230 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 288 transitions. Word has length 12 [2022-11-23 14:06:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:29,231 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 288 transitions. [2022-11-23 14:06:29,231 INFO L496 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) [2022-11-23 14:06:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 288 transitions. [2022-11-23 14:06:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 14:06:29,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:29,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:29,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:06:29,232 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:29,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1118615215, now seen corresponding path program 1 times [2022-11-23 14:06:29,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:29,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262258883] [2022-11-23 14:06:29,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:06:29,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:29,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262258883] [2022-11-23 14:06:29,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262258883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:29,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:29,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 14:06:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37966050] [2022-11-23 14:06:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:29,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:06:29,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:29,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:06:29,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:06:29,585 INFO L87 Difference]: Start difference. First operand 245 states and 288 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) [2022-11-23 14:06:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:30,205 INFO L93 Difference]: Finished difference Result 253 states and 296 transitions. [2022-11-23 14:06:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:06:30,206 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 [2022-11-23 14:06:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:30,207 INFO L225 Difference]: With dead ends: 253 [2022-11-23 14:06:30,207 INFO L226 Difference]: Without dead ends: 253 [2022-11-23 14:06:30,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:06:30,208 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 60 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:30,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 732 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:06:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-23 14:06:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2022-11-23 14:06:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 120 states have (on average 1.975) internal successors, (237), 224 states have internal predecessors, (237), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-23 14:06:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-11-23 14:06:30,218 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 12 [2022-11-23 14:06:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:30,219 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-11-23 14:06:30,219 INFO L496 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) [2022-11-23 14:06:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-11-23 14:06:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:06:30,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:30,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:30,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:06:30,220 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting dll_insert_masterErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:30,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:30,221 INFO L85 PathProgramCache]: Analyzing trace with hash -317313492, now seen corresponding path program 1 times [2022-11-23 14:06:30,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:30,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428762237] [2022-11-23 14:06:30,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:30,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:06:30,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:30,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428762237] [2022-11-23 14:06:30,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428762237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:30,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:30,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:06:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480827265] [2022-11-23 14:06:30,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:30,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:06:30,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:30,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:06:30,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:06:30,334 INFO L87 Difference]: Start difference. First operand 245 states and 286 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) [2022-11-23 14:06:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:30,573 INFO L93 Difference]: Finished difference Result 244 states and 285 transitions. [2022-11-23 14:06:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:06:30,573 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 [2022-11-23 14:06:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:30,575 INFO L225 Difference]: With dead ends: 244 [2022-11-23 14:06:30,575 INFO L226 Difference]: Without dead ends: 244 [2022-11-23 14:06:30,575 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:30,576 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 23 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:30,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 478 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:06:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-23 14:06:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-11-23 14:06:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 120 states have (on average 1.9666666666666666) internal successors, (236), 223 states have internal predecessors, (236), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-23 14:06:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 285 transitions. [2022-11-23 14:06:30,590 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 285 transitions. Word has length 13 [2022-11-23 14:06:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:30,590 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 285 transitions. [2022-11-23 14:06:30,591 INFO L496 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) [2022-11-23 14:06:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 285 transitions. [2022-11-23 14:06:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:06:30,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:30,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:30,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:06:30,593 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting dll_insert_masterErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:30,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash -317313491, now seen corresponding path program 1 times [2022-11-23 14:06:30,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:30,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104686293] [2022-11-23 14:06:30,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:30,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:06:30,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:30,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104686293] [2022-11-23 14:06:30,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104686293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:30,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:30,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:06:30,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027817634] [2022-11-23 14:06:30,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:30,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:06:30,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:06:30,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:06:30,726 INFO L87 Difference]: Start difference. First operand 244 states and 285 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) [2022-11-23 14:06:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:30,938 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2022-11-23 14:06:30,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:06:30,939 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 [2022-11-23 14:06:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:30,940 INFO L225 Difference]: With dead ends: 243 [2022-11-23 14:06:30,940 INFO L226 Difference]: Without dead ends: 243 [2022-11-23 14:06:30,940 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:30,941 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 24 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:30,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 547 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:06:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-23 14:06:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-11-23 14:06:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 120 states have (on average 1.9583333333333333) internal successors, (235), 222 states have internal predecessors, (235), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-23 14:06:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 284 transitions. [2022-11-23 14:06:30,955 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 284 transitions. Word has length 13 [2022-11-23 14:06:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:30,956 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 284 transitions. [2022-11-23 14:06:30,956 INFO L496 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) [2022-11-23 14:06:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 284 transitions. [2022-11-23 14:06:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:06:30,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:30,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:30,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 14:06:30,959 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 4412237, now seen corresponding path program 1 times [2022-11-23 14:06:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:30,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380924550] [2022-11-23 14:06:30,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:30,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:06:31,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:31,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380924550] [2022-11-23 14:06:31,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380924550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:31,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:31,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 14:06:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256920029] [2022-11-23 14:06:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:31,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 14:06:31,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 14:06:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:06:31,543 INFO L87 Difference]: Start difference. First operand 243 states and 284 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 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) [2022-11-23 14:06:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:32,212 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-11-23 14:06:32,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 14:06:32,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 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 [2022-11-23 14:06:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:32,214 INFO L225 Difference]: With dead ends: 270 [2022-11-23 14:06:32,214 INFO L226 Difference]: Without dead ends: 270 [2022-11-23 14:06:32,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-23 14:06:32,215 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 23 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:32,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1326 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 14:06:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-23 14:06:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2022-11-23 14:06:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 131 states have (on average 1.916030534351145) internal successors, (251), 233 states have internal predecessors, (251), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-23 14:06:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2022-11-23 14:06:32,225 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 15 [2022-11-23 14:06:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:32,225 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2022-11-23 14:06:32,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 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) [2022-11-23 14:06:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2022-11-23 14:06:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 14:06:32,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:32,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:32,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 14:06:32,227 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:32,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2063600924, now seen corresponding path program 1 times [2022-11-23 14:06:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:32,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747434021] [2022-11-23 14:06:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:32,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:06:32,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:32,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747434021] [2022-11-23 14:06:32,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747434021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:32,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:32,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:06:32,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944199164] [2022-11-23 14:06:32,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:32,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:06:32,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:32,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:06:32,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:06:32,675 INFO L87 Difference]: Start difference. First operand 257 states and 306 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) [2022-11-23 14:06:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:33,260 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2022-11-23 14:06:33,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:06:33,260 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 [2022-11-23 14:06:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:33,262 INFO L225 Difference]: With dead ends: 255 [2022-11-23 14:06:33,262 INFO L226 Difference]: Without dead ends: 255 [2022-11-23 14:06:33,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:06:33,263 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 49 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:33,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 637 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:06:33,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-23 14:06:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-11-23 14:06:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 131 states have (on average 1.900763358778626) internal successors, (249), 231 states have internal predecessors, (249), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-23 14:06:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2022-11-23 14:06:33,276 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 23 [2022-11-23 14:06:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:33,277 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2022-11-23 14:06:33,277 INFO L496 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) [2022-11-23 14:06:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2022-11-23 14:06:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 14:06:33,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:33,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:33,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 14:06:33,278 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:33,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2063600923, now seen corresponding path program 1 times [2022-11-23 14:06:33,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:33,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117988941] [2022-11-23 14:06:33,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:33,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:06:33,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:33,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117988941] [2022-11-23 14:06:33,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117988941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:33,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:33,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 14:06:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195646143] [2022-11-23 14:06:33,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:33,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:06:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:33,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:06:33,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:06:33,507 INFO L87 Difference]: Start difference. First operand 255 states and 304 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) [2022-11-23 14:06:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:33,957 INFO L93 Difference]: Finished difference Result 253 states and 302 transitions. [2022-11-23 14:06:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:06:33,958 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 [2022-11-23 14:06:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:33,960 INFO L225 Difference]: With dead ends: 253 [2022-11-23 14:06:33,960 INFO L226 Difference]: Without dead ends: 253 [2022-11-23 14:06:33,960 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:33,961 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 45 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:33,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 874 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:06:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-23 14:06:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2022-11-23 14:06:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 131 states have (on average 1.8854961832061068) internal successors, (247), 229 states have internal predecessors, (247), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-23 14:06:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 302 transitions. [2022-11-23 14:06:33,972 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 302 transitions. Word has length 23 [2022-11-23 14:06:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:33,973 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 302 transitions. [2022-11-23 14:06:33,973 INFO L496 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) [2022-11-23 14:06:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 302 transitions. [2022-11-23 14:06:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 14:06:33,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:33,974 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:33,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 14:06:33,975 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:33,975 INFO L85 PathProgramCache]: Analyzing trace with hash -452863182, now seen corresponding path program 1 times [2022-11-23 14:06:33,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:33,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154930359] [2022-11-23 14:06:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:33,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:06:34,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:34,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154930359] [2022-11-23 14:06:34,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154930359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:34,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:34,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:06:34,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981816666] [2022-11-23 14:06:34,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:34,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:06:34,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:34,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:06:34,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:06:34,063 INFO L87 Difference]: Start difference. First operand 253 states and 302 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) [2022-11-23 14:06:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:34,277 INFO L93 Difference]: Finished difference Result 252 states and 301 transitions. [2022-11-23 14:06:34,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:06:34,278 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 [2022-11-23 14:06:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:34,279 INFO L225 Difference]: With dead ends: 252 [2022-11-23 14:06:34,280 INFO L226 Difference]: Without dead ends: 252 [2022-11-23 14:06:34,280 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:34,280 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 20 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:34,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 476 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:06:34,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-23 14:06:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-11-23 14:06:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 131 states have (on average 1.8778625954198473) internal successors, (246), 228 states have internal predecessors, (246), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-23 14:06:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2022-11-23 14:06:34,289 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 24 [2022-11-23 14:06:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:34,289 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2022-11-23 14:06:34,289 INFO L496 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) [2022-11-23 14:06:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2022-11-23 14:06:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 14:06:34,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:34,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:34,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 14:06:34,291 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:34,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:34,291 INFO L85 PathProgramCache]: Analyzing trace with hash -452863181, now seen corresponding path program 1 times [2022-11-23 14:06:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:34,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021537458] [2022-11-23 14:06:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:06:34,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:34,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021537458] [2022-11-23 14:06:34,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021537458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:34,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:34,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:06:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588390274] [2022-11-23 14:06:34,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:34,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:06:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:34,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:06:34,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:06:34,453 INFO L87 Difference]: Start difference. First operand 252 states and 301 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) [2022-11-23 14:06:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:34,637 INFO L93 Difference]: Finished difference Result 251 states and 300 transitions. [2022-11-23 14:06:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:06:34,638 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 [2022-11-23 14:06:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:34,639 INFO L225 Difference]: With dead ends: 251 [2022-11-23 14:06:34,639 INFO L226 Difference]: Without dead ends: 251 [2022-11-23 14:06:34,640 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:06:34,640 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 18 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:34,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 546 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:06:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-23 14:06:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-11-23 14:06:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 131 states have (on average 1.8702290076335877) internal successors, (245), 227 states have internal predecessors, (245), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-23 14:06:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2022-11-23 14:06:34,652 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 24 [2022-11-23 14:06:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:34,653 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2022-11-23 14:06:34,653 INFO L496 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) [2022-11-23 14:06:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2022-11-23 14:06:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 14:06:34,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:34,654 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:06:34,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 14:06:34,655 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1409818669, now seen corresponding path program 1 times [2022-11-23 14:06:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:34,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791402540] [2022-11-23 14:06:34,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:06:35,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:35,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791402540] [2022-11-23 14:06:35,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791402540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:35,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:35,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 14:06:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100885746] [2022-11-23 14:06:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:35,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:06:35,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:06:35,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:06:35,087 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) [2022-11-23 14:06:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:35,595 INFO L93 Difference]: Finished difference Result 260 states and 310 transitions. [2022-11-23 14:06:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:06:35,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 [2022-11-23 14:06:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:35,597 INFO L225 Difference]: With dead ends: 260 [2022-11-23 14:06:35,597 INFO L226 Difference]: Without dead ends: 260 [2022-11-23 14:06:35,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-23 14:06:35,598 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 15 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:35,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1002 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:06:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-23 14:06:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2022-11-23 14:06:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 138 states have (on average 1.826086956521739) internal successors, (252), 235 states have internal predecessors, (252), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (25), 14 states have call predecessors, (25), 18 states have call successors, (25) [2022-11-23 14:06:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2022-11-23 14:06:35,610 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 26 [2022-11-23 14:06:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:35,610 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2022-11-23 14:06:35,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) [2022-11-23 14:06:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2022-11-23 14:06:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 14:06:35,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:35,615 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:06:35,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 14:06:35,615 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash -143384194, now seen corresponding path program 1 times [2022-11-23 14:06:35,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:35,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799431011] [2022-11-23 14:06:35,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:35,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:06:36,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:36,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799431011] [2022-11-23 14:06:36,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799431011] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:06:36,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337753668] [2022-11-23 14:06:36,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:36,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:36,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:36,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:06:36,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:06:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:36,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-23 14:06:36,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:06:36,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:06:37,012 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-23 14:06:37,012 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 29 [2022-11-23 14:06:37,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:06:37,066 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-23 14:06:37,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:06:37,089 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-23 14:06:37,126 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-23 14:06:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:06:37,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:06:39,720 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:39,720 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-23 14:06:39,728 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 34 [2022-11-23 14:06:39,756 INFO L321 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-11-23 14:06:39,757 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 72 [2022-11-23 14:06:39,777 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 32 [2022-11-23 14:06:40,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:40,023 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-23 14:06:40,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:06:40,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:40,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 [2022-11-23 14:06:40,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:40,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 204 [2022-11-23 14:06:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:06:41,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337753668] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:06:41,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1226185197] [2022-11-23 14:06:41,226 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-23 14:06:41,226 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:06:41,231 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:06:41,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:06:41,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-11-23 14:06:41,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540993476] [2022-11-23 14:06:41,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:06:41,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 14:06:41,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:41,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 14:06:41,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=827, Unknown=9, NotChecked=0, Total=930 [2022-11-23 14:06:41,236 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 31 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 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) [2022-11-23 14:06:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:44,618 INFO L93 Difference]: Finished difference Result 261 states and 310 transitions. [2022-11-23 14:06:44,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 14:06:44,619 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 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 [2022-11-23 14:06:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:44,621 INFO L225 Difference]: With dead ends: 261 [2022-11-23 14:06:44,621 INFO L226 Difference]: Without dead ends: 261 [2022-11-23 14:06:44,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=292, Invalid=1421, Unknown=9, NotChecked=0, Total=1722 [2022-11-23 14:06:44,623 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 98 mSDsluCounter, 3319 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 3519 SdHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:44,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 3519 Invalid, 2398 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-23 14:06:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-23 14:06:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2022-11-23 14:06:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 138 states have (on average 1.818840579710145) internal successors, (251), 234 states have internal predecessors, (251), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-23 14:06:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2022-11-23 14:06:44,632 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 37 [2022-11-23 14:06:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:44,633 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2022-11-23 14:06:44,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 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) [2022-11-23 14:06:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2022-11-23 14:06:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 14:06:44,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:44,634 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:06:44,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:06:44,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 14:06:44,842 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:06:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -143384193, now seen corresponding path program 1 times [2022-11-23 14:06:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:44,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330991811] [2022-11-23 14:06:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:44,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:06:46,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:46,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330991811] [2022-11-23 14:06:46,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330991811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:06:46,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209499165] [2022-11-23 14:06:46,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:46,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:46,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:46,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:06:46,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:06:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:46,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-23 14:06:46,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:06:46,338 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 14:06:46,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:06:46,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:06:46,789 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 14:06:46,790 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 26 [2022-11-23 14:06:46,826 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 14:06:46,827 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-23 14:06:46,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:06:46,901 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-23 14:06:46,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:06:46,911 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-23 14:06:46,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:06:46,937 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-23 14:06:46,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:06:46,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 14:06:47,006 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:06:47,010 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-23 14:06:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:06:47,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:06:49,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:49,392 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-23 14:06:49,404 INFO L350 Elim1Store]: Elim1 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 133 treesize of output 117 [2022-11-23 14:06:49,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:49,414 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 95 [2022-11-23 14:06:49,419 INFO L350 Elim1Store]: Elim1 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 148 treesize of output 132 [2022-11-23 14:06:49,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:49,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 172 [2022-11-23 14:06:49,455 INFO L350 Elim1Store]: Elim1 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 157 treesize of output 149 [2022-11-23 14:06:49,463 INFO L350 Elim1Store]: Elim1 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 160 treesize of output 150 [2022-11-23 14:06:49,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:49,476 INFO L350 Elim1Store]: Elim1 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 141 treesize of output 146 [2022-11-23 14:06:49,490 INFO L350 Elim1Store]: Elim1 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 137 treesize of output 135 [2022-11-23 14:06:50,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:50,862 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-23 14:06:50,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:06:50,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:50,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 21 [2022-11-23 14:06:50,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:50,903 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-11-23 14:06:50,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:50,914 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-23 14:06:50,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:06:50,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:50,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 33 [2022-11-23 14:06:50,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:06:50,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:06:50,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 [2022-11-23 14:07:08,783 WARN L233 SmtUtils]: Spent 17.68s on a formula simplification. DAG size of input: 39 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:07:08,966 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 61 [2022-11-23 14:07:09,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 14:07:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:07:09,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209499165] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:07:09,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1321381660] [2022-11-23 14:07:09,251 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-23 14:07:09,251 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:07:09,252 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:07:09,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:07:09,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-11-23 14:07:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381503493] [2022-11-23 14:07:09,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:07:09,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 14:07:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:07:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 14:07:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=952, Unknown=16, NotChecked=0, Total=1056 [2022-11-23 14:07:09,256 INFO L87 Difference]: Start difference. First operand 258 states and 306 transitions. Second operand has 33 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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) [2022-11-23 14:07:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:07:14,508 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2022-11-23 14:07:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 14:07:14,509 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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 [2022-11-23 14:07:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:07:14,513 INFO L225 Difference]: With dead ends: 257 [2022-11-23 14:07:14,513 INFO L226 Difference]: Without dead ends: 257 [2022-11-23 14:07:14,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=316, Invalid=1648, Unknown=16, NotChecked=0, Total=1980 [2022-11-23 14:07:14,515 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 106 mSDsluCounter, 2998 mSDsCounter, 0 mSdLazyCounter, 3175 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 3198 SdHoareTripleChecker+Invalid, 3238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:07:14,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 3198 Invalid, 3238 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3175 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-23 14:07:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-23 14:07:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-11-23 14:07:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 138 states have (on average 1.8115942028985508) internal successors, (250), 233 states have internal predecessors, (250), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-23 14:07:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2022-11-23 14:07:14,530 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 37 [2022-11-23 14:07:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:07:14,530 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2022-11-23 14:07:14,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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) [2022-11-23 14:07:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2022-11-23 14:07:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-23 14:07:14,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:07:14,537 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:07:14,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:07:14,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 14:07:14,744 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:07:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:07:14,744 INFO L85 PathProgramCache]: Analyzing trace with hash -835158194, now seen corresponding path program 1 times [2022-11-23 14:07:14,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:07:14,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348996467] [2022-11-23 14:07:14,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:07:14,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:07:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:07:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:07:14,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:07:14,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348996467] [2022-11-23 14:07:14,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348996467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:07:14,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:07:14,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:07:14,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097229748] [2022-11-23 14:07:14,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:07:14,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:07:14,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:07:14,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:07:14,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:07:14,915 INFO L87 Difference]: Start difference. First operand 257 states and 305 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) [2022-11-23 14:07:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:07:15,100 INFO L93 Difference]: Finished difference Result 246 states and 282 transitions. [2022-11-23 14:07:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:07:15,101 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 [2022-11-23 14:07:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:07:15,102 INFO L225 Difference]: With dead ends: 246 [2022-11-23 14:07:15,102 INFO L226 Difference]: Without dead ends: 246 [2022-11-23 14:07:15,102 INFO L412 NwaCegarLoop]: 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 [2022-11-23 14:07:15,102 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 19 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:07:15,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 802 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:07:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-23 14:07:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-11-23 14:07:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 130 states have (on average 1.823076923076923) internal successors, (237), 225 states have internal predecessors, (237), 29 states have call successors, (29), 11 states have call predecessors, (29), 9 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-11-23 14:07:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2022-11-23 14:07:15,109 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 40 [2022-11-23 14:07:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:07:15,109 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2022-11-23 14:07:15,109 INFO L496 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) [2022-11-23 14:07:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2022-11-23 14:07:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 14:07:15,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:07:15,110 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:07:15,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 14:07:15,110 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:07:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:07:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash 54211896, now seen corresponding path program 1 times [2022-11-23 14:07:15,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:07:15,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579015282] [2022-11-23 14:07:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:07:15,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:07:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:07:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:07:16,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:07:16,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579015282] [2022-11-23 14:07:16,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579015282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:07:16,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498305821] [2022-11-23 14:07:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:07:16,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:07:16,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:07:16,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:07:16,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:07:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:07:16,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-23 14:07:16,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:07:16,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:07:16,452 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 4 [2022-11-23 14:07:16,735 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_952 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int)) (and (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_952) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base|) (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 14:07:16,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:07:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-11-23 14:07:16,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:07:17,469 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_55| Int) (v_ArrVal_974 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_55| v_ArrVal_974) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_55| |c_#StackHeapBarrier|)))) is different from false [2022-11-23 14:07:17,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498305821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:07:17,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1889505513] [2022-11-23 14:07:17,474 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-23 14:07:17,474 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:07:17,474 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:07:17,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:07:17,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2022-11-23 14:07:17,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423783636] [2022-11-23 14:07:17,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:07:17,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 14:07:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:07:17,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 14:07:17,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=630, Unknown=7, NotChecked=102, Total=812 [2022-11-23 14:07:17,481 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 28 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 14:07:19,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:07:21,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:07:30,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:07:30,767 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2022-11-23 14:07:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 14:07:30,768 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-23 14:07:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:07:30,769 INFO L225 Difference]: With dead ends: 249 [2022-11-23 14:07:30,769 INFO L226 Difference]: Without dead ends: 246 [2022-11-23 14:07:30,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=202, Invalid=1427, Unknown=19, NotChecked=158, Total=1806 [2022-11-23 14:07:30,771 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 124 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 37 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:07:30,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 2198 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2447 Invalid, 39 Unknown, 245 Unchecked, 6.3s Time] [2022-11-23 14:07:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-23 14:07:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-11-23 14:07:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 130 states have (on average 1.8153846153846154) internal successors, (236), 225 states have internal predecessors, (236), 29 states have call successors, (29), 11 states have call predecessors, (29), 9 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-11-23 14:07:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 281 transitions. [2022-11-23 14:07:30,778 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 281 transitions. Word has length 46 [2022-11-23 14:07:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:07:30,778 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 281 transitions. [2022-11-23 14:07:30,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 14:07:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 281 transitions. [2022-11-23 14:07:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-23 14:07:30,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:07:30,780 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:07:30,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:07:30,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:07:30,987 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:07:30,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:07:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash -750347739, now seen corresponding path program 1 times [2022-11-23 14:07:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:07:30,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360287483] [2022-11-23 14:07:30,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:07:30,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:07:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:07:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:07:33,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:07:33,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360287483] [2022-11-23 14:07:33,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360287483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:07:33,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285045223] [2022-11-23 14:07:33,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:07:33,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:07:33,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:07:33,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:07:33,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:07:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:07:33,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-23 14:07:33,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:07:33,649 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 14:07:33,774 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:07:33,788 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1154 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1154))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-23 14:07:33,954 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1154 Int) (v_ArrVal_1155 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1154))) (and (= |c_#valid| (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1155)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-23 14:07:33,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:07:33,967 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:07:33,978 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2022-11-23 14:07:34,019 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| Int) (v_ArrVal_1154 Int) (v_ArrVal_1155 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1154))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| |c_#StackHeapBarrier|) (= |c_#valid| (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| v_ArrVal_1155) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-23 14:07:34,071 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| Int) (v_ArrVal_1154 Int) (v_ArrVal_1155 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1157 Int) (|v_dll_create_generic_~#dll~0.base_43| Int)) (let ((.cse0 (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_43| v_ArrVal_1154))) (and (= |c_#valid| (store (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| v_ArrVal_1155) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_43| v_ArrVal_1157)) (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_43|)))) is different from true [2022-11-23 14:07:34,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:07:34,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:07:34,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:07:34,175 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-23 14:07:34,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 39 [2022-11-23 14:07:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-11-23 14:07:34,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:07:34,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285045223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:07:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [260137562] [2022-11-23 14:07:34,498 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-23 14:07:34,498 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:07:34,498 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:07:34,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:07:34,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 30 [2022-11-23 14:07:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852551754] [2022-11-23 14:07:34,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:07:34,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 14:07:34,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:07:34,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 14:07:34,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=627, Unknown=5, NotChecked=270, Total=992 [2022-11-23 14:07:34,501 INFO L87 Difference]: Start difference. First operand 246 states and 281 transitions. Second operand has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-23 14:08:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:08:02,048 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-11-23 14:08:02,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 14:08:02,049 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 47 [2022-11-23 14:08:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:08:02,050 INFO L225 Difference]: With dead ends: 270 [2022-11-23 14:08:02,050 INFO L226 Difference]: Without dead ends: 270 [2022-11-23 14:08:02,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=220, Invalid=1590, Unknown=16, NotChecked=430, Total=2256 [2022-11-23 14:08:02,052 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 283 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 3800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1293 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:08:02,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1084 Invalid, 3800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2409 Invalid, 0 Unknown, 1293 Unchecked, 3.3s Time] [2022-11-23 14:08:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-23 14:08:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 254. [2022-11-23 14:08:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 136 states have (on average 1.8014705882352942) internal successors, (245), 229 states have internal predecessors, (245), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-23 14:08:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 293 transitions. [2022-11-23 14:08:02,059 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 293 transitions. Word has length 47 [2022-11-23 14:08:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:08:02,060 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 293 transitions. [2022-11-23 14:08:02,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-23 14:08:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 293 transitions. [2022-11-23 14:08:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-23 14:08:02,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:08:02,061 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:08:02,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:08:02,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:08:02,272 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:08:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:08:02,272 INFO L85 PathProgramCache]: Analyzing trace with hash -750347738, now seen corresponding path program 1 times [2022-11-23 14:08:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:08:02,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719851931] [2022-11-23 14:08:02,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:02,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:08:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:08:03,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:08:03,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719851931] [2022-11-23 14:08:03,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719851931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:03,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121622497] [2022-11-23 14:08:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:03,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:08:03,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:08:03,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:08:03,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:08:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:03,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-23 14:08:03,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:08:03,886 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 14:08:04,031 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:08:04,035 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:08:04,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:04,466 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 14:08:04,624 WARN L859 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_~#dll~0.base| Int)) (and (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (exists ((v_ArrVal_1361 Int) (v_ArrVal_1360 Int) (v_ArrVal_1363 Int) (v_ArrVal_1362 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| Int) (v_ArrVal_1359 Int)) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_1359))) (let ((.cse1 (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1362))) (and (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_1360) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1361) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| v_ArrVal_1363)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (= (select .cse1 |dll_create_generic_~#dll~0.base|) 1) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66|) 0))))))) is different from true [2022-11-23 14:08:04,769 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1361 Int) (v_ArrVal_1360 Int) (v_ArrVal_1363 Int) (|dll_create_generic_~#dll~0.base| Int) (v_ArrVal_1362 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| Int) (v_ArrVal_1359 Int)) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_1359))) (let ((.cse1 (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1362))) (and (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_1360) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1361) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| v_ArrVal_1363)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (= (select .cse1 |dll_create_generic_~#dll~0.base|) 1) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66|) 0))))) is different from true [2022-11-23 14:08:04,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:04,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:04,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:04,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:04,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:04,851 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:08:04,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-23 14:08:04,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:04,889 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-23 14:08:04,889 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 63 [2022-11-23 14:08:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:08:04,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:08:07,584 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| Int)) (or (forall ((|v_dll_create_generic_~#dll~0.base_62| Int)) (or (forall ((v_ArrVal_1401 Int)) (let ((.cse1 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1401))) (or (forall ((v_ArrVal_1399 Int)) (let ((.cse0 (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| v_ArrVal_1399))) (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84| Int)) (or (not (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84|) 0)) (forall ((v_ArrVal_1398 Int) (v_ArrVal_1400 Int) (v_ArrVal_1402 Int)) (<= (+ |c_dll_insert_master_~item~1#1.offset| 12) (select (store (store (store |c_#length| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1402) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| v_ArrVal_1400) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84| v_ArrVal_1398) |c_dll_insert_master_~item~1#1.base|))))) (not (= (select .cse0 |v_dll_create_generic_~#dll~0.base_62|) 1))))) (not (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83|) 0))))) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_62|)))) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| |c_#StackHeapBarrier|)))) (or (forall ((|v_dll_create_generic_~#dll~0.base_62| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84| Int) (v_ArrVal_1399 Int) (v_ArrVal_1401 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| Int)) (let ((.cse3 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1401))) (let ((.cse2 (store .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| v_ArrVal_1399))) (or (not (= (select .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84|) 0)) (not (= (select .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83|) 0)) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_62|)) (not (= (select .cse2 |v_dll_create_generic_~#dll~0.base_62|) 1)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| |c_#StackHeapBarrier|)))))) (<= 0 (+ |c_dll_insert_master_~item~1#1.offset| 8)))) is different from false [2022-11-23 14:08:07,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121622497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:07,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2036310266] [2022-11-23 14:08:07,590 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-23 14:08:07,590 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:08:07,591 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:08:07,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:08:07,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2022-11-23 14:08:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507694058] [2022-11-23 14:08:07,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:08:07,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 14:08:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:08:07,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 14:08:07,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=509, Unknown=4, NotChecked=144, Total=756 [2022-11-23 14:08:07,593 INFO L87 Difference]: Start difference. First operand 254 states and 293 transitions. Second operand has 26 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-23 14:08:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:08:24,594 INFO L93 Difference]: Finished difference Result 261 states and 302 transitions. [2022-11-23 14:08:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 14:08:24,595 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 47 [2022-11-23 14:08:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:08:24,595 INFO L225 Difference]: With dead ends: 261 [2022-11-23 14:08:24,596 INFO L226 Difference]: Without dead ends: 261 [2022-11-23 14:08:24,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=171, Invalid=891, Unknown=6, NotChecked=192, Total=1260 [2022-11-23 14:08:24,597 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 216 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 61 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 3062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:08:24,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 952 Invalid, 3062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2453 Invalid, 53 Unknown, 495 Unchecked, 3.1s Time] [2022-11-23 14:08:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-23 14:08:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2022-11-23 14:08:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 136 states have (on average 1.786764705882353) internal successors, (243), 229 states have internal predecessors, (243), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-23 14:08:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 291 transitions. [2022-11-23 14:08:24,604 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 291 transitions. Word has length 47 [2022-11-23 14:08:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:08:24,604 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 291 transitions. [2022-11-23 14:08:24,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-23 14:08:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 291 transitions. [2022-11-23 14:08:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 14:08:24,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:08:24,605 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:08:24,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:08:24,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:08:24,816 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:08:24,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:08:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1785924258, now seen corresponding path program 1 times [2022-11-23 14:08:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:08:24,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538995266] [2022-11-23 14:08:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:24,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:08:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 14:08:26,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:08:26,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538995266] [2022-11-23 14:08:26,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538995266] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:26,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496476432] [2022-11-23 14:08:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:26,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:08:26,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:08:26,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:08:26,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:08:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:26,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-23 14:08:26,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:08:26,378 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:08:26,415 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1594 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1594))) (< |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-23 14:08:26,428 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1594 Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_1594)))) is different from true [2022-11-23 14:08:30,531 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2022-11-23 14:08:34,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:34,804 INFO L321 Elim1Store]: treesize reduction 67, result has 31.6 percent of original size [2022-11-23 14:08:34,805 INFO L350 Elim1Store]: Elim1 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 4 case distinctions, treesize of input 26 treesize of output 42 [2022-11-23 14:08:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-11-23 14:08:34,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:08:35,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496476432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:35,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2056041973] [2022-11-23 14:08:35,034 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-23 14:08:35,034 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:08:35,035 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:08:35,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:08:35,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 21 [2022-11-23 14:08:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785791837] [2022-11-23 14:08:35,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:08:35,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 14:08:35,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:08:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 14:08:35,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=327, Unknown=7, NotChecked=114, Total=506 [2022-11-23 14:08:35,037 INFO L87 Difference]: Start difference. First operand 254 states and 291 transitions. Second operand has 22 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-23 14:08:37,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:08:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:08:46,341 INFO L93 Difference]: Finished difference Result 262 states and 304 transitions. [2022-11-23 14:08:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 14:08:46,344 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2022-11-23 14:08:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:08:46,345 INFO L225 Difference]: With dead ends: 262 [2022-11-23 14:08:46,346 INFO L226 Difference]: Without dead ends: 262 [2022-11-23 14:08:46,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=182, Invalid=1080, Unknown=10, NotChecked=210, Total=1482 [2022-11-23 14:08:46,348 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 313 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 100 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 749 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:08:46,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1018 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1383 Invalid, 5 Unknown, 749 Unchecked, 4.2s Time] [2022-11-23 14:08:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-23 14:08:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2022-11-23 14:08:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 138 states have (on average 1.789855072463768) internal successors, (247), 231 states have internal predecessors, (247), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-23 14:08:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2022-11-23 14:08:46,356 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 48 [2022-11-23 14:08:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:08:46,357 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2022-11-23 14:08:46,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-23 14:08:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2022-11-23 14:08:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 14:08:46,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:08:46,358 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:08:46,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-23 14:08:46,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-23 14:08:46,565 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:08:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:08:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1785924257, now seen corresponding path program 1 times [2022-11-23 14:08:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:08:46,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970422933] [2022-11-23 14:08:46,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:46,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:08:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 14:08:47,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:08:47,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970422933] [2022-11-23 14:08:47,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970422933] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:47,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884693203] [2022-11-23 14:08:47,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:47,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:08:47,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:08:47,841 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:08:47,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 14:08:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:48,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-23 14:08:48,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:08:48,353 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:08:48,358 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:08:48,428 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_1810 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1810) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 14:08:54,580 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1811 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1811))))) is different from true [2022-11-23 14:09:04,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:04,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:04,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:04,876 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 14:09:04,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-11-23 14:09:04,896 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:09:04,896 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-23 14:09:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-11-23 14:09:04,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:09:13,326 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:09:13,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884693203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:09:13,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2073578257] [2022-11-23 14:09:13,329 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-23 14:09:13,329 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:09:13,329 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:09:13,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:09:13,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2022-11-23 14:09:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920762111] [2022-11-23 14:09:13,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:09:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 14:09:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:09:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 14:09:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=664, Unknown=10, NotChecked=106, Total=870 [2022-11-23 14:09:13,331 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand has 29 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-23 14:09:15,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:09:17,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:09:23,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:09:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:09:45,459 INFO L93 Difference]: Finished difference Result 257 states and 295 transitions. [2022-11-23 14:09:45,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 14:09:45,460 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 48 [2022-11-23 14:09:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:09:45,461 INFO L225 Difference]: With dead ends: 257 [2022-11-23 14:09:45,461 INFO L226 Difference]: Without dead ends: 257 [2022-11-23 14:09:45,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=223, Invalid=1411, Unknown=14, NotChecked=158, Total=1806 [2022-11-23 14:09:45,463 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 311 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 88 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 2761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:09:45,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1510 Invalid, 2761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2157 Invalid, 36 Unknown, 480 Unchecked, 8.6s Time] [2022-11-23 14:09:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-23 14:09:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2022-11-23 14:09:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 138 states have (on average 1.7753623188405796) internal successors, (245), 231 states have internal predecessors, (245), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-23 14:09:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 293 transitions. [2022-11-23 14:09:45,469 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 293 transitions. Word has length 48 [2022-11-23 14:09:45,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:09:45,470 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 293 transitions. [2022-11-23 14:09:45,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-23 14:09:45,470 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 293 transitions. [2022-11-23 14:09:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 14:09:45,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:09:45,471 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:09:45,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 14:09:45,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 14:09:45,678 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:09:45,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:09:45,678 INFO L85 PathProgramCache]: Analyzing trace with hash -410953665, now seen corresponding path program 1 times [2022-11-23 14:09:45,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:09:45,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124865505] [2022-11-23 14:09:45,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:09:45,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:09:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:09:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-23 14:09:46,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:09:46,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124865505] [2022-11-23 14:09:46,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124865505] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:09:46,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713241151] [2022-11-23 14:09:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:09:46,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:09:46,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:09:46,042 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:09:46,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 14:09:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:09:46,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-23 14:09:46,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:09:46,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:46,566 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:09:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:09:46,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:09:46,918 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 20 [2022-11-23 14:09:47,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:47,043 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 14:09:47,044 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2022-11-23 14:09:47,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:47,127 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 14:09:47,127 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2022-11-23 14:09:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:09:47,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713241151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:09:47,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1103781779] [2022-11-23 14:09:47,223 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-23 14:09:47,223 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:09:47,224 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:09:47,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:09:47,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2022-11-23 14:09:47,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183234667] [2022-11-23 14:09:47,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:09:47,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 14:09:47,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:09:47,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 14:09:47,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-11-23 14:09:47,227 INFO L87 Difference]: Start difference. First operand 256 states and 293 transitions. Second operand has 24 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 13 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-23 14:09:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:09:48,165 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2022-11-23 14:09:48,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 14:09:48,165 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 13 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 60 [2022-11-23 14:09:48,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:09:48,167 INFO L225 Difference]: With dead ends: 254 [2022-11-23 14:09:48,167 INFO L226 Difference]: Without dead ends: 254 [2022-11-23 14:09:48,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-11-23 14:09:48,167 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 95 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:09:48,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 2143 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 14:09:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-23 14:09:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-11-23 14:09:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 138 states have (on average 1.7608695652173914) internal successors, (243), 229 states have internal predecessors, (243), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-23 14:09:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 291 transitions. [2022-11-23 14:09:48,179 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 291 transitions. Word has length 60 [2022-11-23 14:09:48,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:09:48,179 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 291 transitions. [2022-11-23 14:09:48,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 13 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-23 14:09:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 291 transitions. [2022-11-23 14:09:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 14:09:48,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:09:48,181 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:09:48,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-23 14:09:48,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:09:48,388 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:09:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:09:48,388 INFO L85 PathProgramCache]: Analyzing trace with hash -410953664, now seen corresponding path program 1 times [2022-11-23 14:09:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:09:48,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231352829] [2022-11-23 14:09:48,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:09:48,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:09:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:09:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:09:49,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:09:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231352829] [2022-11-23 14:09:49,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231352829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:09:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494877058] [2022-11-23 14:09:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:09:49,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:09:49,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:09:49,077 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:09:49,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 14:09:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:09:49,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-23 14:09:49,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:09:49,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:49,603 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:09:49,611 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:09:49,612 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-23 14:09:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:09:49,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:09:50,144 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 41 [2022-11-23 14:09:50,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:09:50,170 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 62 [2022-11-23 14:09:50,395 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 14:09:50,395 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 14:09:50,411 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 14:09:50,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 12 [2022-11-23 14:09:50,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:09:50,501 INFO L350 Elim1Store]: Elim1 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 30 [2022-11-23 14:09:50,517 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 14:09:50,517 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 12 [2022-11-23 14:09:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:09:50,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494877058] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:09:50,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [344949506] [2022-11-23 14:09:50,612 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-23 14:09:50,612 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:09:50,613 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:09:50,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:09:50,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 23 [2022-11-23 14:09:50,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387704421] [2022-11-23 14:09:50,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:09:50,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 14:09:50,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:09:50,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 14:09:50,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-11-23 14:09:50,616 INFO L87 Difference]: Start difference. First operand 254 states and 291 transitions. Second operand has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-23 14:09:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:09:51,915 INFO L93 Difference]: Finished difference Result 252 states and 289 transitions. [2022-11-23 14:09:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 14:09:51,915 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 60 [2022-11-23 14:09:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:09:51,917 INFO L225 Difference]: With dead ends: 252 [2022-11-23 14:09:51,917 INFO L226 Difference]: Without dead ends: 252 [2022-11-23 14:09:51,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2022-11-23 14:09:51,918 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 138 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:09:51,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1965 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 14:09:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-23 14:09:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-11-23 14:09:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 227 states have internal predecessors, (241), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-23 14:09:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 289 transitions. [2022-11-23 14:09:51,925 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 289 transitions. Word has length 60 [2022-11-23 14:09:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:09:51,925 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 289 transitions. [2022-11-23 14:09:51,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-23 14:09:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 289 transitions. [2022-11-23 14:09:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-23 14:09:51,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:09:51,927 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:09:51,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 14:09:52,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-23 14:09:52,134 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:09:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:09:52,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1299602016, now seen corresponding path program 1 times [2022-11-23 14:09:52,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:09:52,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625355293] [2022-11-23 14:09:52,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:09:52,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:09:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:09:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 21 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:09:56,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:09:56,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625355293] [2022-11-23 14:09:56,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625355293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:09:56,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650111321] [2022-11-23 14:09:56,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:09:56,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:09:56,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:09:56,371 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:09:56,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 14:09:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:09:56,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-23 14:09:56,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:09:56,835 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:09:57,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:09:57,173 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 25 [2022-11-23 14:09:57,193 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-23 14:09:57,194 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 26 treesize of output 16 [2022-11-23 14:09:57,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:10:06,443 INFO L350 Elim1Store]: Elim1 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 67 treesize of output 47 [2022-11-23 14:10:06,448 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 20 [2022-11-23 14:10:06,579 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-23 14:10:06,579 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 22 [2022-11-23 14:10:07,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:07,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:07,383 INFO L321 Elim1Store]: treesize reduction 206, result has 13.4 percent of original size [2022-11-23 14:10:07,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 64 treesize of output 77 [2022-11-23 14:10:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:10:07,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:10:08,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650111321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:10:08,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [815750079] [2022-11-23 14:10:08,413 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-23 14:10:08,413 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:10:08,414 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:10:08,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:10:08,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 46 [2022-11-23 14:10:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109928198] [2022-11-23 14:10:08,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:10:08,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-23 14:10:08,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:10:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-23 14:10:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2059, Unknown=16, NotChecked=0, Total=2256 [2022-11-23 14:10:08,417 INFO L87 Difference]: Start difference. First operand 252 states and 289 transitions. Second operand has 47 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 9 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-23 14:10:11,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:10:14,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:10:17,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:10:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:10:23,423 INFO L93 Difference]: Finished difference Result 287 states and 337 transitions. [2022-11-23 14:10:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 14:10:23,424 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 9 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 61 [2022-11-23 14:10:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:10:23,425 INFO L225 Difference]: With dead ends: 287 [2022-11-23 14:10:23,425 INFO L226 Difference]: Without dead ends: 287 [2022-11-23 14:10:23,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=483, Invalid=4318, Unknown=29, NotChecked=0, Total=4830 [2022-11-23 14:10:23,427 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 344 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 3666 mSolverCounterSat, 117 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 3797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3666 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:10:23,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1264 Invalid, 3797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3666 Invalid, 14 Unknown, 0 Unchecked, 12.1s Time] [2022-11-23 14:10:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-23 14:10:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 261. [2022-11-23 14:10:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 232 states have internal predecessors, (250), 30 states have call successors, (30), 11 states have call predecessors, (30), 13 states have return successors, (23), 20 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-23 14:10:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 303 transitions. [2022-11-23 14:10:23,434 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 303 transitions. Word has length 61 [2022-11-23 14:10:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:10:23,435 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 303 transitions. [2022-11-23 14:10:23,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 9 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-23 14:10:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 303 transitions. [2022-11-23 14:10:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-23 14:10:23,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:10:23,436 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:10:23,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 14:10:23,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-23 14:10:23,643 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:10:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:10:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1299602015, now seen corresponding path program 1 times [2022-11-23 14:10:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:10:23,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665317795] [2022-11-23 14:10:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:10:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:10:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:10:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-23 14:10:25,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:10:25,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665317795] [2022-11-23 14:10:25,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665317795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:10:25,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462494807] [2022-11-23 14:10:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:10:25,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:10:25,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:10:25,690 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:10:25,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 14:10:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:10:26,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 171 conjunts are in the unsatisfiable core [2022-11-23 14:10:26,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:10:26,222 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 14:10:26,226 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:10:26,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:10:26,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:26,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:26,830 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 19 [2022-11-23 14:10:26,837 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 14 treesize of output 11 [2022-11-23 14:10:26,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:26,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:26,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 14:10:26,967 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 14:10:26,972 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 14:10:27,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:10:27,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:27,844 INFO L350 Elim1Store]: Elim1 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 79 [2022-11-23 14:10:27,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:27,856 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 13 [2022-11-23 14:10:28,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:28,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:28,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:28,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:28,113 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-23 14:10:28,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 34 [2022-11-23 14:10:28,119 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 12 [2022-11-23 14:10:28,506 INFO L350 Elim1Store]: Elim1 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 60 treesize of output 44 [2022-11-23 14:10:29,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,159 INFO L321 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-11-23 14:10:29,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2022-11-23 14:10:29,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:29,252 INFO L321 Elim1Store]: treesize reduction 34, result has 40.4 percent of original size [2022-11-23 14:10:29,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 75 treesize of output 85 [2022-11-23 14:10:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:10:29,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:10:31,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:31,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:31,641 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:10:31,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 66 [2022-11-23 14:10:31,656 INFO L350 Elim1Store]: Elim1 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 72 treesize of output 64 [2022-11-23 14:10:31,673 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 24 [2022-11-23 14:10:40,108 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:10:40,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462494807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:10:40,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [312642882] [2022-11-23 14:10:40,111 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-23 14:10:40,111 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:10:40,112 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:10:40,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:10:40,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28] total 40 [2022-11-23 14:10:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626129982] [2022-11-23 14:10:40,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:10:40,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-23 14:10:40,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:10:40,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-23 14:10:40,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1564, Unknown=11, NotChecked=0, Total=1806 [2022-11-23 14:10:40,113 INFO L87 Difference]: Start difference. First operand 261 states and 303 transitions. Second operand has 41 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 35 states have internal predecessors, (82), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-23 14:10:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:10:45,309 INFO L93 Difference]: Finished difference Result 268 states and 312 transitions. [2022-11-23 14:10:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 14:10:45,310 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 35 states have internal predecessors, (82), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 61 [2022-11-23 14:10:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:10:45,311 INFO L225 Difference]: With dead ends: 268 [2022-11-23 14:10:45,311 INFO L226 Difference]: Without dead ends: 268 [2022-11-23 14:10:45,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=330, Invalid=2406, Unknown=20, NotChecked=0, Total=2756 [2022-11-23 14:10:45,312 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 150 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 43 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:10:45,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 845 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2212 Invalid, 23 Unknown, 0 Unchecked, 3.8s Time] [2022-11-23 14:10:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-23 14:10:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 261. [2022-11-23 14:10:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 144 states have (on average 1.7222222222222223) internal successors, (248), 232 states have internal predecessors, (248), 30 states have call successors, (30), 11 states have call predecessors, (30), 13 states have return successors, (23), 20 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-23 14:10:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 301 transitions. [2022-11-23 14:10:45,319 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 301 transitions. Word has length 61 [2022-11-23 14:10:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:10:45,319 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 301 transitions. [2022-11-23 14:10:45,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 35 states have internal predecessors, (82), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-23 14:10:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2022-11-23 14:10:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-23 14:10:45,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:10:45,321 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:10:45,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 14:10:45,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-23 14:10:45,527 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:10:45,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:10:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2044777986, now seen corresponding path program 1 times [2022-11-23 14:10:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:10:45,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960829453] [2022-11-23 14:10:45,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:10:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:10:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:10:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-23 14:10:46,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:10:46,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960829453] [2022-11-23 14:10:46,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960829453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:10:46,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842094656] [2022-11-23 14:10:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:10:46,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:10:46,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:10:46,367 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:10:46,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 14:10:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:10:46,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-23 14:10:46,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:10:46,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:10:47,072 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-23 14:10:47,073 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 29 [2022-11-23 14:10:47,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:47,122 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-23 14:10:47,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:47,140 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-23 14:10:47,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:47,153 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-23 14:10:47,189 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-23 14:10:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:10:47,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:10:47,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3213 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_dll_insert_master_alloc_or_die_master_~ptr~1#1.base| v_ArrVal_3213) |c_dll_insert_master_~dll#1.base|) |c_dll_insert_master_~dll#1.offset|)) 1)) is different from false [2022-11-23 14:10:47,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:47,555 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-23 14:10:47,559 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 34 [2022-11-23 14:10:47,581 INFO L321 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-11-23 14:10:47,581 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 72 [2022-11-23 14:10:47,587 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 32 [2022-11-23 14:10:47,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:47,773 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-23 14:10:47,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:47,786 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-23 14:10:47,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:10:47,809 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-11-23 14:10:47,809 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 38 [2022-11-23 14:10:47,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:47,929 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-23 14:10:47,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:47,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:47,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 [2022-11-23 14:10:48,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:48,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 204 [2022-11-23 14:10:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 3 not checked. [2022-11-23 14:10:48,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842094656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:10:48,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [67280060] [2022-11-23 14:10:48,689 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-23 14:10:48,689 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:10:48,690 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:10:48,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:10:48,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-11-23 14:10:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531578671] [2022-11-23 14:10:48,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:10:48,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 14:10:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:10:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 14:10:48,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=896, Unknown=2, NotChecked=60, Total=1056 [2022-11-23 14:10:48,693 INFO L87 Difference]: Start difference. First operand 261 states and 301 transitions. Second operand has 33 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 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) [2022-11-23 14:10:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:10:51,114 INFO L93 Difference]: Finished difference Result 263 states and 305 transitions. [2022-11-23 14:10:51,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 14:10:51,115 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 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 63 [2022-11-23 14:10:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:10:51,116 INFO L225 Difference]: With dead ends: 263 [2022-11-23 14:10:51,116 INFO L226 Difference]: Without dead ends: 263 [2022-11-23 14:10:51,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=228, Invalid=1496, Unknown=2, NotChecked=80, Total=1806 [2022-11-23 14:10:51,117 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 83 mSDsluCounter, 2945 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:10:51,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 3146 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2186 Invalid, 0 Unknown, 140 Unchecked, 1.9s Time] [2022-11-23 14:10:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-23 14:10:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2022-11-23 14:10:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 145 states have (on average 1.710344827586207) internal successors, (248), 232 states have internal predecessors, (248), 30 states have call successors, (30), 11 states have call predecessors, (30), 14 states have return successors, (23), 21 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-23 14:10:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 301 transitions. [2022-11-23 14:10:51,128 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 301 transitions. Word has length 63 [2022-11-23 14:10:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:10:51,128 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 301 transitions. [2022-11-23 14:10:51,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 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) [2022-11-23 14:10:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 301 transitions. [2022-11-23 14:10:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-23 14:10:51,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:10:51,132 INFO L195 NwaCegarLoop]: 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] [2022-11-23 14:10:51,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 14:10:51,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-23 14:10:51,339 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting dll_insert_masterErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:10:51,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:10:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2044777985, now seen corresponding path program 1 times [2022-11-23 14:10:51,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:10:51,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955531544] [2022-11-23 14:10:51,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:10:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:10:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:10:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-23 14:10:52,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:10:52,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955531544] [2022-11-23 14:10:52,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955531544] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:10:52,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110426162] [2022-11-23 14:10:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:10:52,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:10:52,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:10:52,581 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:10:52,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 14:10:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:10:53,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-23 14:10:53,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:10:53,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:10:53,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:10:53,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:53,855 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 14:10:53,866 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 14:10:53,867 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-23 14:10:53,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:53,968 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-23 14:10:53,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:53,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 14:10:54,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:54,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 14:10:54,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:54,010 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-23 14:10:54,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:54,044 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-23 14:10:54,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:54,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 14:10:54,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:54,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 14:10:54,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:54,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:54,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 12 [2022-11-23 14:10:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:10:54,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:10:58,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:58,339 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2022-11-23 14:10:58,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:58,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 129 treesize of output 125 [2022-11-23 14:10:58,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:58,365 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 89 [2022-11-23 14:10:58,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:58,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 142 treesize of output 134 [2022-11-23 14:10:58,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:58,416 INFO L350 Elim1Store]: Elim1 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 188 treesize of output 202 [2022-11-23 14:10:58,426 INFO L350 Elim1Store]: Elim1 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 169 treesize of output 161 [2022-11-23 14:10:58,436 INFO L350 Elim1Store]: Elim1 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 182 treesize of output 170 [2022-11-23 14:10:58,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:10:58,469 INFO L350 Elim1Store]: Elim1 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 160 treesize of output 178 [2022-11-23 14:10:58,484 INFO L350 Elim1Store]: Elim1 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 149 treesize of output 147 [2022-11-23 14:11:03,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:03,474 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 191 [2022-11-23 14:11:03,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:03,490 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 159 [2022-11-23 14:11:03,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:03,525 INFO L350 Elim1Store]: Elim1 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 221 treesize of output 235 [2022-11-23 14:11:03,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:03,684 INFO L350 Elim1Store]: Elim1 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 307 treesize of output 371 [2022-11-23 14:11:03,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:03,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 401 treesize of output 471 [2022-11-23 14:11:03,871 INFO L350 Elim1Store]: Elim1 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 370 treesize of output 362 [2022-11-23 14:11:03,908 INFO L350 Elim1Store]: Elim1 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 405 treesize of output 389 [2022-11-23 14:11:04,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:04,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 361 treesize of output 431 [2022-11-23 14:11:04,171 INFO L350 Elim1Store]: Elim1 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 346 treesize of output 344 [2022-11-23 14:11:04,222 INFO L350 Elim1Store]: Elim1 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 344 treesize of output 336 [2022-11-23 14:11:04,270 INFO L350 Elim1Store]: Elim1 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 336 treesize of output 334 [2022-11-23 14:11:04,316 INFO L350 Elim1Store]: Elim1 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 375 treesize of output 359 [2022-11-23 14:11:27,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:27,923 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-23 14:11:27,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:27,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 37 [2022-11-23 14:11:27,948 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 9 [2022-11-23 14:11:27,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:27,975 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-11-23 14:11:27,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:27,988 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-23 14:11:27,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:11:28,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:28,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 33 [2022-11-23 14:11:28,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:11:28,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:28,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 [2022-11-23 14:11:28,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:28,131 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-23 14:11:28,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:11:28,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:28,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 21 [2022-11-23 14:11:30,604 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 136 [2022-11-23 14:11:30,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:30,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 136 treesize of output 290 [2022-11-23 14:11:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:11:34,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110426162] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:11:34,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2003774834] [2022-11-23 14:11:34,269 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-23 14:11:34,269 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:11:34,270 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:11:34,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:11:34,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 17] total 42 [2022-11-23 14:11:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942148862] [2022-11-23 14:11:34,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:11:34,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-23 14:11:34,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:34,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-23 14:11:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1642, Unknown=19, NotChecked=0, Total=1806 [2022-11-23 14:11:34,273 INFO L87 Difference]: Start difference. First operand 262 states and 301 transitions. Second operand has 43 states, 35 states have (on average 2.342857142857143) internal successors, (82), 36 states have internal predecessors, (82), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-23 14:11:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:11:39,506 INFO L93 Difference]: Finished difference Result 262 states and 304 transitions. [2022-11-23 14:11:39,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 14:11:39,507 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 2.342857142857143) internal successors, (82), 36 states have internal predecessors, (82), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Word has length 63 [2022-11-23 14:11:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:11:39,508 INFO L225 Difference]: With dead ends: 262 [2022-11-23 14:11:39,508 INFO L226 Difference]: Without dead ends: 262 [2022-11-23 14:11:39,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=360, Invalid=2699, Unknown=21, NotChecked=0, Total=3080 [2022-11-23 14:11:39,510 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 138 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 3391 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:11:39,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 3391 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-23 14:11:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-23 14:11:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2022-11-23 14:11:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 145 states have (on average 1.703448275862069) internal successors, (247), 231 states have internal predecessors, (247), 30 states have call successors, (30), 11 states have call predecessors, (30), 14 states have return successors, (23), 21 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-23 14:11:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 300 transitions. [2022-11-23 14:11:39,516 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 300 transitions. Word has length 63 [2022-11-23 14:11:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:11:39,517 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 300 transitions. [2022-11-23 14:11:39,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 2.342857142857143) internal successors, (82), 36 states have internal predecessors, (82), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-23 14:11:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions. [2022-11-23 14:11:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 14:11:39,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:11:39,518 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 14:11:39,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 14:11:39,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-23 14:11:39,725 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:11:39,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:11:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1632937661, now seen corresponding path program 1 times [2022-11-23 14:11:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:11:39,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790378775] [2022-11-23 14:11:39,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:11:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 14:11:41,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:11:41,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790378775] [2022-11-23 14:11:41,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790378775] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:11:41,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794155619] [2022-11-23 14:11:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:11:41,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:11:41,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:11:41,500 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:11:41,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 14:11:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:11:41,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-23 14:11:41,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:11:41,951 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:11:42,000 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:11:42,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:11:42,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:11:42,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:11:42,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:11:42,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:11:42,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:11:42,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-11-23 14:11:42,613 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 16 [2022-11-23 14:11:47,171 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 66 [2022-11-23 14:11:47,177 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 20 [2022-11-23 14:11:47,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:11:47,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:11:47,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:11:47,705 INFO L321 Elim1Store]: treesize reduction 121, result has 31.3 percent of original size [2022-11-23 14:11:47,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 476 treesize of output 503 [2022-11-23 14:11:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:11:48,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:11:48,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:11:48,678 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-23 14:11:48,689 INFO L350 Elim1Store]: Elim1 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 123 treesize of output 99 [2022-11-23 14:11:48,698 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 46 [2022-11-23 14:11:48,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794155619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:11:48,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [659390772] [2022-11-23 14:11:48,872 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-23 14:11:48,872 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:11:48,872 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:11:48,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:11:48,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 28] total 35 [2022-11-23 14:11:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206599986] [2022-11-23 14:11:48,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:11:48,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-23 14:11:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:11:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-23 14:11:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1196, Unknown=5, NotChecked=0, Total=1332 [2022-11-23 14:11:48,875 INFO L87 Difference]: Start difference. First operand 261 states and 300 transitions. Second operand has 36 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 31 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-23 14:12:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:12:02,761 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2022-11-23 14:12:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-23 14:12:02,762 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 31 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 62 [2022-11-23 14:12:02,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:12:02,763 INFO L225 Difference]: With dead ends: 277 [2022-11-23 14:12:02,764 INFO L226 Difference]: Without dead ends: 277 [2022-11-23 14:12:02,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=407, Invalid=3365, Unknown=10, NotChecked=0, Total=3782 [2022-11-23 14:12:02,766 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 293 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 108 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3878 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:12:02,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1864 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3878 Invalid, 8 Unknown, 0 Unchecked, 6.3s Time] [2022-11-23 14:12:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-23 14:12:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263. [2022-11-23 14:12:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 147 states have (on average 1.7074829931972788) internal successors, (251), 233 states have internal predecessors, (251), 30 states have call successors, (30), 11 states have call predecessors, (30), 14 states have return successors, (23), 21 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-23 14:12:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2022-11-23 14:12:02,773 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 62 [2022-11-23 14:12:02,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:12:02,774 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2022-11-23 14:12:02,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 31 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-23 14:12:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2022-11-23 14:12:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 14:12:02,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:12:02,775 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 14:12:02,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 14:12:02,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:12:02,983 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:12:02,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:12:02,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1632937660, now seen corresponding path program 1 times [2022-11-23 14:12:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:12:02,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411348328] [2022-11-23 14:12:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:12:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:12:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:12:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:12:06,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:12:06,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411348328] [2022-11-23 14:12:06,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411348328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:12:06,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589847507] [2022-11-23 14:12:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:12:06,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:12:06,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:12:06,919 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:12:06,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 14:12:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:12:07,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-23 14:12:07,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:12:07,682 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:12:07,685 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:12:07,761 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_4052 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4052) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 14:12:09,907 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_4053 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4053) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 14:12:14,193 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4054 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4054))))) is different from true [2022-11-23 14:12:26,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:12:26,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:12:26,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:12:26,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:12:26,726 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-23 14:12:26,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 52 [2022-11-23 14:12:26,743 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:12:26,744 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-23 14:12:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 25 not checked. [2022-11-23 14:12:26,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:12:35,277 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:12:35,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589847507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:12:35,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2026164109] [2022-11-23 14:12:35,279 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-23 14:12:35,279 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:12:35,280 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:12:35,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:12:35,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 17] total 47 [2022-11-23 14:12:35,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502608943] [2022-11-23 14:12:35,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:12:35,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-23 14:12:35,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:12:35,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-23 14:12:35,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1870, Unknown=12, NotChecked=270, Total=2352 [2022-11-23 14:12:35,283 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 48 states, 41 states have (on average 2.317073170731707) internal successors, (95), 40 states have internal predecessors, (95), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-23 14:12:37,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:12:39,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:12:41,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:12:49,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:12:57,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:13:08,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:13:10,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:13:35,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:13:37,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:14:03,782 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 93 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:14:29,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:14:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:29,791 INFO L93 Difference]: Finished difference Result 277 states and 321 transitions. [2022-11-23 14:14:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-23 14:14:29,792 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 41 states have (on average 2.317073170731707) internal successors, (95), 40 states have internal predecessors, (95), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 62 [2022-11-23 14:14:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:29,794 INFO L225 Difference]: With dead ends: 277 [2022-11-23 14:14:29,794 INFO L226 Difference]: Without dead ends: 277 [2022-11-23 14:14:29,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 117.4s TimeCoverageRelationStatistics Valid=612, Invalid=5215, Unknown=37, NotChecked=456, Total=6320 [2022-11-23 14:14:29,796 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 466 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 173 mSolverCounterUnsat, 62 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 62 IncrementalHoareTripleChecker+Unknown, 772 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:29,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1907 Invalid, 4415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 3408 Invalid, 62 Unknown, 772 Unchecked, 25.6s Time] [2022-11-23 14:14:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-23 14:14:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263. [2022-11-23 14:14:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 145 states have (on average 1.703448275862069) internal successors, (247), 234 states have internal predecessors, (247), 31 states have call successors, (31), 11 states have call predecessors, (31), 15 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-23 14:14:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 305 transitions. [2022-11-23 14:14:29,809 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 305 transitions. Word has length 62 [2022-11-23 14:14:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:29,810 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 305 transitions. [2022-11-23 14:14:29,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 41 states have (on average 2.317073170731707) internal successors, (95), 40 states have internal predecessors, (95), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-23 14:14:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 305 transitions. [2022-11-23 14:14:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-23 14:14:29,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:29,811 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 14:14:29,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:30,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:14:30,015 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:14:30,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:30,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1298418956, now seen corresponding path program 1 times [2022-11-23 14:14:30,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:14:30,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411386612] [2022-11-23 14:14:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:14:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-11-23 14:14:31,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:14:31,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411386612] [2022-11-23 14:14:31,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411386612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:14:31,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939283983] [2022-11-23 14:14:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:31,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:14:31,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:14:31,108 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:14:31,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 14:14:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:31,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-23 14:14:31,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:31,714 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 14:14:31,793 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:14:31,818 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|) (exists ((v_ArrVal_4593 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_4593)))) is different from true [2022-11-23 14:14:31,920 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_4594 Int) (v_ArrVal_4593 Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_4593))) (and (= |c_#valid| (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4594)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-23 14:14:31,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:31,927 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:14:31,934 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4595 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4595))) is different from true [2022-11-23 14:14:31,941 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4595 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_4595))) is different from true [2022-11-23 14:14:32,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:32,102 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:14:32,111 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4596 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4596))) is different from true [2022-11-23 14:14:32,117 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4596 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_4596))) is different from true [2022-11-23 14:14:32,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:32,298 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:14:32,305 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2022-11-23 14:14:32,337 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_328| Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_318| Int) (v_ArrVal_4594 Int) (v_ArrVal_4593 Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_4593))) (and (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store (store (store (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4594) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_318| 1) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_328| 1))))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-23 14:14:32,381 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_328| Int) (|v_dll_create_generic_~#dll~0.base_184| Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_318| Int) (v_ArrVal_4598 Int) (v_ArrVal_4594 Int) (v_ArrVal_4593 Int)) (let ((.cse0 (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_184| v_ArrVal_4593))) (and (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_184|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (= |c_#valid| (store (store (store (store (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4594) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_318| 1) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_328| 1) |v_dll_create_generic_~#dll~0.base_184| v_ArrVal_4598))))) is different from true [2022-11-23 14:14:32,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:32,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:32,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:32,552 INFO L321 Elim1Store]: treesize reduction 195, result has 21.1 percent of original size [2022-11-23 14:14:32,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 63 [2022-11-23 14:14:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 132 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 42 not checked. [2022-11-23 14:14:32,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:14:33,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939283983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:14:33,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523471527] [2022-11-23 14:14:33,064 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-23 14:14:33,064 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:14:33,064 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:14:33,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:14:33,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 29 [2022-11-23 14:14:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582910300] [2022-11-23 14:14:33,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:14:33,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 14:14:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:14:33,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 14:14:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=385, Unknown=10, NotChecked=414, Total=870 [2022-11-23 14:14:33,066 INFO L87 Difference]: Start difference. First operand 263 states and 305 transitions. Second operand has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 12 states have call successors, (18), 4 states have call predecessors, (18), 7 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2022-11-23 14:14:33,796 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_4594 Int) (v_ArrVal_4593 Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_4593))) (and (= |c_#valid| (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4594)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|)))) (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_4594 Int) (v_ArrVal_4595 Int) (v_ArrVal_4593 Int)) (let ((.cse1 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_4593))) (and (= (select .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4594) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_4595)) (= 1 (select |c_#valid| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|))))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-23 14:14:36,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_318| Int) (v_ArrVal_4599 Int) (v_ArrVal_4594 Int) (v_ArrVal_4593 Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_4593))) (and (= |c_#valid| (store (store (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4594) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_318| 1) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_4599)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= 1 (select |c_#valid| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|))))) (exists ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_328| Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_318| Int) (v_ArrVal_4594 Int) (v_ArrVal_4593 Int)) (let ((.cse1 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_4593))) (and (= (select .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store (store (store (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4594) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_318| 1) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_328| 1))))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-23 14:14:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:14:36,441 INFO L93 Difference]: Finished difference Result 281 states and 316 transitions. [2022-11-23 14:14:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 14:14:36,441 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 12 states have call successors, (18), 4 states have call predecessors, (18), 7 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) Word has length 123 [2022-11-23 14:14:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:14:36,443 INFO L225 Difference]: With dead ends: 281 [2022-11-23 14:14:36,443 INFO L226 Difference]: Without dead ends: 281 [2022-11-23 14:14:36,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=248, Invalid=1588, Unknown=14, NotChecked=1012, Total=2862 [2022-11-23 14:14:36,444 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 201 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 69 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 4980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 2466 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:14:36,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1656 Invalid, 4980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2386 Invalid, 59 Unknown, 2466 Unchecked, 2.2s Time] [2022-11-23 14:14:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-23 14:14:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-11-23 14:14:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 147 states have (on average 1.7074829931972788) internal successors, (251), 233 states have internal predecessors, (251), 31 states have call successors, (31), 11 states have call predecessors, (31), 14 states have return successors, (23), 22 states have call predecessors, (23), 17 states have call successors, (23) [2022-11-23 14:14:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 305 transitions. [2022-11-23 14:14:36,452 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 305 transitions. Word has length 123 [2022-11-23 14:14:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:14:36,452 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 305 transitions. [2022-11-23 14:14:36,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 12 states have call successors, (18), 4 states have call predecessors, (18), 7 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2022-11-23 14:14:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 305 transitions. [2022-11-23 14:14:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-23 14:14:36,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:14:36,454 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 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] [2022-11-23 14:14:36,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 14:14:36,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-23 14:14:36,663 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:14:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:14:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash -467489352, now seen corresponding path program 1 times [2022-11-23 14:14:36,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:14:36,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810488887] [2022-11-23 14:14:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:14:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 129 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-23 14:14:41,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:14:41,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810488887] [2022-11-23 14:14:41,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810488887] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:14:41,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638279310] [2022-11-23 14:14:41,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:14:41,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:14:41,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:14:41,380 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:14:41,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 14:14:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:14:41,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-23 14:14:42,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:14:42,180 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 14:14:42,191 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 14:14:42,396 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:14:42,400 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:14:42,419 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5149 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_5149))) (exists ((v_ArrVal_5148 Int)) (= |c_#length| (store |c_old(#length)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_5148))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-23 14:14:42,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:42,788 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:14:43,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:43,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:43,144 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:14:43,145 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-23 14:14:43,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:43,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:43,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:43,593 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-23 14:14:43,593 INFO L350 Elim1Store]: Elim1 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 95 treesize of output 90 [2022-11-23 14:14:43,916 WARN L859 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_~#dll~0.base| Int)) (and (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (v_ArrVal_5149 Int) (v_ArrVal_5148 Int) (v_ArrVal_5158 Int) (v_ArrVal_5157 Int) (v_ArrVal_5156 Int) (v_ArrVal_5153 Int) (v_ArrVal_5152 Int) (v_ArrVal_5151 Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_337| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| Int)) (let ((.cse2 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_5149))) (let ((.cse1 (store .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1))) (let ((.cse0 (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5152))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355|) 0) (= |c_#length| (store (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_5148) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5151) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5153) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| v_ArrVal_5158) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_337| v_ArrVal_5156)) (= (select .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (= (select (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| v_ArrVal_5157) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_337|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| |c_#StackHeapBarrier|) (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_337| |c_#StackHeapBarrier|)))))))) is different from true [2022-11-23 14:14:44,205 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (v_ArrVal_5149 Int) (v_ArrVal_5148 Int) (v_ArrVal_5158 Int) (v_ArrVal_5157 Int) (v_ArrVal_5156 Int) (v_ArrVal_5153 Int) (v_ArrVal_5152 Int) (v_ArrVal_5151 Int) (|dll_create_generic_~#dll~0.base| Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_337| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| Int)) (let ((.cse2 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_5149))) (let ((.cse1 (store .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1))) (let ((.cse0 (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5152))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355|) 0) (= |c_#length| (store (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_5148) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5151) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5153) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| v_ArrVal_5158) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_337| v_ArrVal_5156)) (= (select .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (= (select (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| v_ArrVal_5157) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_337|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| |c_#StackHeapBarrier|) (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_337| |c_#StackHeapBarrier|)))))) is different from true [2022-11-23 14:14:44,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,398 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 14:14:44,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 45 [2022-11-23 14:14:44,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:14:44,508 INFO L321 Elim1Store]: treesize reduction 58, result has 28.4 percent of original size [2022-11-23 14:14:44,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 432 treesize of output 438 [2022-11-23 14:14:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 94 proven. 93 refuted. 0 times theorem prover too weak. 35 trivial. 9 not checked. [2022-11-23 14:14:44,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:14:47,964 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_390| Int) (v_ArrVal_5228 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_391| Int) (|v_dll_create_generic_~#dll~0.base_201| Int) (v_ArrVal_5225 Int) (v_ArrVal_5223 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| Int)) (let ((.cse1 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_201| v_ArrVal_5228))) (let ((.cse2 (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| 1))) (let ((.cse0 (store .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_390| v_ArrVal_5223))) (or (not (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| |c_#StackHeapBarrier|)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_391| |c_#StackHeapBarrier|)) (not (= (select (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| v_ArrVal_5225) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_391|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| |c_#StackHeapBarrier|)) (not (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_390| |c_#StackHeapBarrier|)) (not (= (select .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_390|) 0)) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_201|))))))) (<= 0 (+ |c_dll_insert_master_~item~1#1.offset| 8))) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| |c_#StackHeapBarrier|)) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| |c_#StackHeapBarrier|)) (forall ((|v_dll_create_generic_~#dll~0.base_201| Int)) (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_391| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_391| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5228 Int)) (let ((.cse5 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_201| v_ArrVal_5228))) (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_390| Int) (v_ArrVal_5225 Int) (v_ArrVal_5223 Int)) (let ((.cse4 (store .cse5 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| 1))) (let ((.cse3 (store .cse4 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_390| v_ArrVal_5223))) (or (not (= (select .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389|) 0)) (not (= (select (store .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| v_ArrVal_5225) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_391|) 0)) (forall ((v_ArrVal_5227 Int) (v_ArrVal_5226 Int) (v_ArrVal_5224 Int) (v_ArrVal_5222 Int) (v_ArrVal_5221 Int)) (<= (+ |c_dll_insert_master_~item~1#1.offset| 12) (select (store (store (store (store (store |c_#length| |v_dll_create_generic_~#dll~0.base_201| v_ArrVal_5227) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| v_ArrVal_5221) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_390| v_ArrVal_5222) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| v_ArrVal_5224) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_391| v_ArrVal_5226) |c_dll_insert_master_~item~1#1.base|))) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_390| |c_#StackHeapBarrier|)) (not (= (select .cse4 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_390|) 0)))))) (not (= (select .cse5 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388|) 0))))))) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_201|))))))))) is different from false [2022-11-23 14:14:47,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638279310] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:14:47,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [751460777] [2022-11-23 14:14:47,971 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-23 14:14:47,971 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:14:47,972 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:14:47,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:14:47,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 36 [2022-11-23 14:14:47,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254625182] [2022-11-23 14:14:47,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:14:47,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-23 14:14:47,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:14:47,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-23 14:14:47,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1056, Unknown=4, NotChecked=276, Total=1482 [2022-11-23 14:14:47,975 INFO L87 Difference]: Start difference. First operand 264 states and 305 transitions. Second operand has 37 states, 31 states have (on average 4.032258064516129) internal successors, (125), 33 states have internal predecessors, (125), 15 states have call successors, (20), 2 states have call predecessors, (20), 11 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2022-11-23 14:15:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:15:13,846 INFO L93 Difference]: Finished difference Result 275 states and 318 transitions. [2022-11-23 14:15:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 14:15:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 4.032258064516129) internal successors, (125), 33 states have internal predecessors, (125), 15 states have call successors, (20), 2 states have call predecessors, (20), 11 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) Word has length 124 [2022-11-23 14:15:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:15:13,849 INFO L225 Difference]: With dead ends: 275 [2022-11-23 14:15:13,849 INFO L226 Difference]: Without dead ends: 275 [2022-11-23 14:15:13,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=355, Invalid=2620, Unknown=11, NotChecked=436, Total=3422 [2022-11-23 14:15:13,851 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 185 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 2837 mSolverCounterSat, 63 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 3693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2837 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 780 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:15:13,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1514 Invalid, 3693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2837 Invalid, 13 Unknown, 780 Unchecked, 4.8s Time] [2022-11-23 14:15:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-23 14:15:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 264. [2022-11-23 14:15:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 147 states have (on average 1.6938775510204083) internal successors, (249), 233 states have internal predecessors, (249), 31 states have call successors, (31), 11 states have call predecessors, (31), 14 states have return successors, (23), 22 states have call predecessors, (23), 17 states have call successors, (23) [2022-11-23 14:15:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 303 transitions. [2022-11-23 14:15:13,858 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 303 transitions. Word has length 124 [2022-11-23 14:15:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:15:13,859 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 303 transitions. [2022-11-23 14:15:13,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 4.032258064516129) internal successors, (125), 33 states have internal predecessors, (125), 15 states have call successors, (20), 2 states have call predecessors, (20), 11 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2022-11-23 14:15:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 303 transitions. [2022-11-23 14:15:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-23 14:15:13,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:15:13,860 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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] [2022-11-23 14:15:13,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 14:15:14,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-23 14:15:14,061 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:15:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:15:14,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1607248884, now seen corresponding path program 1 times [2022-11-23 14:15:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:15:14,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166348106] [2022-11-23 14:15:14,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:15:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 132 proven. 18 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-23 14:15:17,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:15:17,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166348106] [2022-11-23 14:15:17,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166348106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:15:17,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243202303] [2022-11-23 14:15:17,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:15:17,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:15:17,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:15:17,142 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:15:17,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 14:15:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:15:17,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-23 14:15:17,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:15:18,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:18,140 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:15:18,186 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:15:18,254 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:15:18,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:18,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:18,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:15:18,491 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_5760 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5760))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 14:15:18,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:18,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:18,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:15:18,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:15:18,927 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5761 Int)) (= |c_#valid| (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) v_ArrVal_5761))) is different from true [2022-11-23 14:15:21,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:21,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:21,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:15:21,778 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_5766 (Array Int Int)) (v_ArrVal_5764 Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5764)) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5766) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)))) is different from true [2022-11-23 14:15:21,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:21,924 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 24 [2022-11-23 14:15:26,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:26,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:26,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:26,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:26,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:26,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:26,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:15:26,600 INFO L321 Elim1Store]: treesize reduction 119, result has 29.2 percent of original size [2022-11-23 14:15:26,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 84 [2022-11-23 14:15:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 127 proven. 50 refuted. 0 times theorem prover too weak. 16 trivial. 39 not checked. [2022-11-23 14:15:26,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:15:27,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:15:27,430 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 14:15:27,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:15:27,451 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 45 [2022-11-23 14:15:27,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243202303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:15:27,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2130895048] [2022-11-23 14:15:27,603 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-23 14:15:27,603 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:15:27,603 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:15:27,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:15:27,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 33] total 45 [2022-11-23 14:15:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129321317] [2022-11-23 14:15:27,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:15:27,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-23 14:15:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:15:27,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-23 14:15:27,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1711, Unknown=15, NotChecked=258, Total=2162 [2022-11-23 14:15:27,606 INFO L87 Difference]: Start difference. First operand 264 states and 303 transitions. Second operand has 46 states, 38 states have (on average 3.3157894736842106) internal successors, (126), 38 states have internal predecessors, (126), 17 states have call successors, (23), 7 states have call predecessors, (23), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) [2022-11-23 14:15:31,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:15:36,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:15:43,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:15:48,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:16:03,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:16:18,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:16:20,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:16:22,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:16:24,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:16:26,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:16:38,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:16:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:16:39,961 INFO L93 Difference]: Finished difference Result 279 states and 323 transitions. [2022-11-23 14:16:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 14:16:39,962 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 3.3157894736842106) internal successors, (126), 38 states have internal predecessors, (126), 17 states have call successors, (23), 7 states have call predecessors, (23), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) Word has length 125 [2022-11-23 14:16:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:16:39,964 INFO L225 Difference]: With dead ends: 279 [2022-11-23 14:16:39,964 INFO L226 Difference]: Without dead ends: 279 [2022-11-23 14:16:39,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=503, Invalid=4161, Unknown=40, NotChecked=408, Total=5112 [2022-11-23 14:16:39,965 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 398 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 3074 mSolverCounterSat, 146 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 3074 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 765 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:16:39,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1703 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 3074 Invalid, 24 Unknown, 765 Unchecked, 30.4s Time] [2022-11-23 14:16:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-23 14:16:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 266. [2022-11-23 14:16:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 149 states have (on average 1.6979865771812082) internal successors, (253), 235 states have internal predecessors, (253), 31 states have call successors, (31), 11 states have call predecessors, (31), 14 states have return successors, (23), 22 states have call predecessors, (23), 17 states have call successors, (23) [2022-11-23 14:16:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 307 transitions. [2022-11-23 14:16:39,973 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 307 transitions. Word has length 125 [2022-11-23 14:16:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:16:39,973 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 307 transitions. [2022-11-23 14:16:39,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 3.3157894736842106) internal successors, (126), 38 states have internal predecessors, (126), 17 states have call successors, (23), 7 states have call predecessors, (23), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) [2022-11-23 14:16:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 307 transitions. [2022-11-23 14:16:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-23 14:16:39,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:16:39,974 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-23 14:16:39,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 14:16:40,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:16:40,175 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:16:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:16:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1767470999, now seen corresponding path program 2 times [2022-11-23 14:16:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:16:40,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378286659] [2022-11-23 14:16:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:16:40,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:16:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:16:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:16:50,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:16:50,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378286659] [2022-11-23 14:16:50,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378286659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:16:50,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253904888] [2022-11-23 14:16:50,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:16:50,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:16:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:16:50,706 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:16:50,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4398528-2e78-4880-aab4-ca56c66e87ce/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 14:16:59,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 14:16:59,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:16:59,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-23 14:16:59,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:17:00,624 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:17:00,628 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-23 14:17:00,800 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6147 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6147) |c_#length|)))) is different from true [2022-11-23 14:17:11,621 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6148 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6148) |c_#length|)))) is different from true [2022-11-23 14:17:24,655 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_6149 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6149) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 14:17:43,660 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_6150 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6150) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 14:18:02,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:18:02,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:18:02,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:18:02,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:18:02,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:18:03,099 INFO L321 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-11-23 14:18:03,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 70 [2022-11-23 14:18:03,128 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:18:03,128 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-23 14:18:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 51 not checked. [2022-11-23 14:18:03,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:18:12,020 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:18:12,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253904888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:18:12,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1929580105] [2022-11-23 14:18:12,023 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-23 14:18:12,024 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:18:12,024 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 14:18:12,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:18:12,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 19] total 60 [2022-11-23 14:18:12,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860238026] [2022-11-23 14:18:12,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:18:12,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-23 14:18:12,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:18:12,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-23 14:18:12,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=3029, Unknown=33, NotChecked=460, Total=3782 [2022-11-23 14:18:12,027 INFO L87 Difference]: Start difference. First operand 266 states and 307 transitions. Second operand has 61 states, 54 states have (on average 2.185185185185185) internal successors, (118), 52 states have internal predecessors, (118), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-23 14:18:14,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:18:16,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:18:18,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:18:20,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:18:30,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:18:36,897 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 112 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:18:47,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:18:49,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:18:57,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:19:07,883 WARN L233 SmtUtils]: Spent 9.12s on a formula simplification. DAG size of input: 81 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:19:19,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:19:38,971 WARN L233 SmtUtils]: Spent 8.79s on a formula simplification. DAG size of input: 78 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:20:01,616 WARN L233 SmtUtils]: Spent 10.76s on a formula simplification. DAG size of input: 88 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:20:08,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:20:19,467 WARN L233 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 83 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:20:21,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:20:35,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:20:37,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:20:39,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]