./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 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_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba --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 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 --- 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-b5237d8 [2022-11-22 01:09:07,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:09:07,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:09:07,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:09:07,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:09:07,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:09:07,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:09:07,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:09:07,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:09:07,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:09:07,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:09:07,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:09:07,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:09:07,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:09:07,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:09:07,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:09:07,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:09:07,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:09:07,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:09:07,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:09:07,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:09:07,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:09:07,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:09:07,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:09:07,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:09:07,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:09:07,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:09:07,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:09:07,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:09:07,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:09:07,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:09:07,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:09:07,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:09:07,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:09:07,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:09:07,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:09:07,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:09:07,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:09:07,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:09:07,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:09:07,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:09:07,439 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 01:09:07,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:09:07,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:09:07,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:09:07,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:09:07,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:09:07,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:09:07,486 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:09:07,487 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:09:07,487 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:09:07,487 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:09:07,487 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:09:07,487 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:09:07,487 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:09:07,488 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:09:07,488 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:09:07,488 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:09:07,488 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:09:07,488 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:09:07,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 01:09:07,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 01:09:07,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:09:07,490 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:09:07,490 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:09:07,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:09:07,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:09:07,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:09:07,491 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 01:09:07,491 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 01:09:07,491 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 01:09:07,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:09:07,491 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 01:09:07,491 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:09:07,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:09:07,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:09:07,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:09:07,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:09:07,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:09:07,492 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:09:07,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:09:07,493 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:09:07,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:09:07,493 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:09:07,493 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_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/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_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba 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 -> 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 [2022-11-22 01:09:07,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:09:07,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:09:07,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:09:07,824 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:09:07,825 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:09:07,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2022-11-22 01:09:10,799 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:09:11,086 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:09:11,092 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2022-11-22 01:09:11,116 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/data/520a48e65/fff92aa7c61c4458b6747978731c47e1/FLAG2a6c4ded5 [2022-11-22 01:09:11,137 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/data/520a48e65/fff92aa7c61c4458b6747978731c47e1 [2022-11-22 01:09:11,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:09:11,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:09:11,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:09:11,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:09:11,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:09:11,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:11,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d1e12da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11, skipping insertion in model container [2022-11-22 01:09:11,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:11,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:09:11,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:09:11,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:09:11,836 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:09:11,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:09:11,999 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:09:12,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11 WrapperNode [2022-11-22 01:09:12,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:09:12,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:09:12,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:09:12,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:09:12,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,053 INFO L138 Inliner]: procedures = 371, calls = 35, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 111 [2022-11-22 01:09:12,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:09:12,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:09:12,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:09:12,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:09:12,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,080 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:09:12,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:09:12,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:09:12,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:09:12,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (1/1) ... [2022-11-22 01:09:12,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:09:12,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:12,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:09:12,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:09:12,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:09:12,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 01:09:12,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:09:12,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:09:12,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:09:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-22 01:09:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 01:09:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:09:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 01:09:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-22 01:09:12,183 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-22 01:09:12,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:09:12,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:09:12,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:09:12,186 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:09:12,380 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:09:12,390 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:09:12,808 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:09:12,816 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:09:12,816 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:09:12,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:12 BoogieIcfgContainer [2022-11-22 01:09:12,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:09:12,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:09:12,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:09:12,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:09:12,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:09:11" (1/3) ... [2022-11-22 01:09:12,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1792fb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:09:12, skipping insertion in model container [2022-11-22 01:09:12,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:11" (2/3) ... [2022-11-22 01:09:12,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1792fb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:09:12, skipping insertion in model container [2022-11-22 01:09:12,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:12" (3/3) ... [2022-11-22 01:09:12,828 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2022-11-22 01:09:12,855 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:09:12,856 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-22 01:09:12,856 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:09:12,946 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 01:09:12,981 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:09:12,996 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 183 transitions, 371 flow [2022-11-22 01:09:12,999 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 183 transitions, 371 flow [2022-11-22 01:09:13,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 183 transitions, 371 flow [2022-11-22 01:09:13,100 INFO L130 PetriNetUnfolder]: 2/182 cut-off events. [2022-11-22 01:09:13,100 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 01:09:13,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 182 events. 2/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 186 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-11-22 01:09:13,109 INFO L119 LiptonReduction]: Number of co-enabled transitions 3136 [2022-11-22 01:09:38,268 WARN L233 SmtUtils]: Spent 7.54s on a formula simplification. DAG size of input: 209 DAG size of output: 196 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:09:49,387 WARN L233 SmtUtils]: Spent 7.53s on a formula simplification. DAG size of input: 205 DAG size of output: 192 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:10:23,883 WARN L233 SmtUtils]: Spent 12.42s on a formula simplification. DAG size of input: 257 DAG size of output: 249 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:10:30,068 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 245 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:10:44,647 WARN L233 SmtUtils]: Spent 14.58s on a formula simplification. DAG size of input: 256 DAG size of output: 248 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:10:51,763 WARN L233 SmtUtils]: Spent 7.11s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:11:14,349 WARN L233 SmtUtils]: Spent 22.06s on a formula simplification. DAG size of input: 273 DAG size of output: 270 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:11:25,435 WARN L233 SmtUtils]: Spent 11.08s on a formula simplification that was a NOOP. DAG size: 266 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:11:48,882 WARN L233 SmtUtils]: Spent 23.44s on a formula simplification. DAG size of input: 272 DAG size of output: 266 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:12:00,223 WARN L233 SmtUtils]: Spent 11.34s on a formula simplification that was a NOOP. DAG size: 262 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-22 01:12:00,228 INFO L134 LiptonReduction]: Checked pairs total: 12018 [2022-11-22 01:12:00,228 INFO L136 LiptonReduction]: Total number of compositions: 249 [2022-11-22 01:12:00,237 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 58 transitions, 121 flow [2022-11-22 01:12:00,275 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 348 states, 225 states have (on average 2.831111111111111) internal successors, (637), 347 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:00,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:12:00,299 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;@6654f978, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:12:00,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-11-22 01:12:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 348 states, 225 states have (on average 2.831111111111111) internal successors, (637), 347 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 01:12:00,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:00,309 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 01:12:00,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash 703, now seen corresponding path program 1 times [2022-11-22 01:12:00,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:00,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916370393] [2022-11-22 01:12:00,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:00,447 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-22 01:12:00,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:00,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916370393] [2022-11-22 01:12:00,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916370393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:00,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:00,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 01:12:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741751412] [2022-11-22 01:12:00,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:00,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 01:12:00,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:00,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 01:12:00,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:12:00,496 INFO L87 Difference]: Start difference. First operand has 348 states, 225 states have (on average 2.831111111111111) internal successors, (637), 347 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:00,708 INFO L93 Difference]: Finished difference Result 298 states and 559 transitions. [2022-11-22 01:12:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 01:12:00,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-22 01:12:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:00,733 INFO L225 Difference]: With dead ends: 298 [2022-11-22 01:12:00,742 INFO L226 Difference]: Without dead ends: 298 [2022-11-22 01:12:00,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:12:00,747 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:00,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:12:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-22 01:12:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-11-22 01:12:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 211 states have (on average 2.6492890995260665) internal successors, (559), 297 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 559 transitions. [2022-11-22 01:12:00,854 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 559 transitions. Word has length 1 [2022-11-22 01:12:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:00,855 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 559 transitions. [2022-11-22 01:12:00,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 559 transitions. [2022-11-22 01:12:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 01:12:00,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:00,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 01:12:00,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:12:00,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:00,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:00,862 INFO L85 PathProgramCache]: Analyzing trace with hash 702160, now seen corresponding path program 1 times [2022-11-22 01:12:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:00,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885463708] [2022-11-22 01:12:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:00,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:01,787 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-22 01:12:01,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:01,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885463708] [2022-11-22 01:12:01,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885463708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:01,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:01,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:12:01,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708335371] [2022-11-22 01:12:01,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:01,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:12:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:01,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:12:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:12:01,798 INFO L87 Difference]: Start difference. First operand 298 states and 559 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:02,008 INFO L93 Difference]: Finished difference Result 304 states and 550 transitions. [2022-11-22 01:12:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:12:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-22 01:12:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:02,011 INFO L225 Difference]: With dead ends: 304 [2022-11-22 01:12:02,011 INFO L226 Difference]: Without dead ends: 304 [2022-11-22 01:12:02,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-22 01:12:02,013 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:02,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:12:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-22 01:12:02,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 268. [2022-11-22 01:12:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 192 states have (on average 2.6041666666666665) internal successors, (500), 267 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 500 transitions. [2022-11-22 01:12:02,030 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 500 transitions. Word has length 3 [2022-11-22 01:12:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:02,030 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 500 transitions. [2022-11-22 01:12:02,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 500 transitions. [2022-11-22 01:12:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:12:02,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:02,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:12:02,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:12:02,032 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:02,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash 21767439, now seen corresponding path program 1 times [2022-11-22 01:12:02,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:02,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152358086] [2022-11-22 01:12:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:02,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:02,817 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-22 01:12:02,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:02,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152358086] [2022-11-22 01:12:02,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152358086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:02,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:02,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:12:02,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140587788] [2022-11-22 01:12:02,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:02,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:12:02,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:12:02,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:12:02,820 INFO L87 Difference]: Start difference. First operand 268 states and 500 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:02,995 INFO L93 Difference]: Finished difference Result 266 states and 496 transitions. [2022-11-22 01:12:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:12:02,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-22 01:12:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:02,998 INFO L225 Difference]: With dead ends: 266 [2022-11-22 01:12:02,998 INFO L226 Difference]: Without dead ends: 266 [2022-11-22 01:12:02,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-22 01:12:02,999 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:03,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:12:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-22 01:12:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-11-22 01:12:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 190 states have (on average 2.610526315789474) internal successors, (496), 265 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 496 transitions. [2022-11-22 01:12:03,013 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 496 transitions. Word has length 4 [2022-11-22 01:12:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:03,013 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 496 transitions. [2022-11-22 01:12:03,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 496 transitions. [2022-11-22 01:12:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:12:03,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:03,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:12:03,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:12:03,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 21767545, now seen corresponding path program 1 times [2022-11-22 01:12:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:03,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903643636] [2022-11-22 01:12:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:03,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:04,841 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-22 01:12:04,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:04,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903643636] [2022-11-22 01:12:04,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903643636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:04,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:04,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:12:04,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320198749] [2022-11-22 01:12:04,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:04,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:12:04,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:04,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:12:04,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:12:04,846 INFO L87 Difference]: Start difference. First operand 266 states and 496 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:05,036 INFO L93 Difference]: Finished difference Result 262 states and 487 transitions. [2022-11-22 01:12:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:12:05,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-22 01:12:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:05,039 INFO L225 Difference]: With dead ends: 262 [2022-11-22 01:12:05,039 INFO L226 Difference]: Without dead ends: 262 [2022-11-22 01:12:05,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-22 01:12:05,041 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:05,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:12:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-22 01:12:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-11-22 01:12:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 187 states have (on average 2.6042780748663104) internal successors, (487), 261 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 487 transitions. [2022-11-22 01:12:05,065 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 487 transitions. Word has length 4 [2022-11-22 01:12:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:05,066 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 487 transitions. [2022-11-22 01:12:05,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:05,066 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 487 transitions. [2022-11-22 01:12:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:12:05,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:05,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:12:05,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:12:05,067 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:05,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:05,068 INFO L85 PathProgramCache]: Analyzing trace with hash 674790912, now seen corresponding path program 1 times [2022-11-22 01:12:05,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:05,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400584683] [2022-11-22 01:12:05,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:05,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:07,581 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-22 01:12:07,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:07,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400584683] [2022-11-22 01:12:07,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400584683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:07,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:07,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:12:07,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723536993] [2022-11-22 01:12:07,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:07,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:12:07,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:07,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:12:07,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:12:07,583 INFO L87 Difference]: Start difference. First operand 262 states and 487 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:08,011 INFO L93 Difference]: Finished difference Result 260 states and 483 transitions. [2022-11-22 01:12:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:12:08,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 01:12:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:08,013 INFO L225 Difference]: With dead ends: 260 [2022-11-22 01:12:08,013 INFO L226 Difference]: Without dead ends: 260 [2022-11-22 01:12:08,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:12:08,014 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:08,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 15 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:12:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-22 01:12:08,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2022-11-22 01:12:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 185 states have (on average 2.610810810810811) internal successors, (483), 259 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 483 transitions. [2022-11-22 01:12:08,022 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 483 transitions. Word has length 5 [2022-11-22 01:12:08,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:08,023 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 483 transitions. [2022-11-22 01:12:08,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 483 transitions. [2022-11-22 01:12:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:12:08,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:08,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:12:08,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:12:08,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash 674791122, now seen corresponding path program 1 times [2022-11-22 01:12:08,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:08,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479374983] [2022-11-22 01:12:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:08,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:10,235 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-22 01:12:10,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:10,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479374983] [2022-11-22 01:12:10,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479374983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:10,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:10,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:12:10,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393828276] [2022-11-22 01:12:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:10,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:12:10,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:10,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:12:10,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:12:10,238 INFO L87 Difference]: Start difference. First operand 260 states and 483 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:10,621 INFO L93 Difference]: Finished difference Result 256 states and 474 transitions. [2022-11-22 01:12:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:12:10,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 01:12:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:10,623 INFO L225 Difference]: With dead ends: 256 [2022-11-22 01:12:10,623 INFO L226 Difference]: Without dead ends: 256 [2022-11-22 01:12:10,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:12:10,624 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:10,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:12:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-22 01:12:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-11-22 01:12:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 182 states have (on average 2.6043956043956045) internal successors, (474), 255 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 474 transitions. [2022-11-22 01:12:10,632 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 474 transitions. Word has length 5 [2022-11-22 01:12:10,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:10,633 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 474 transitions. [2022-11-22 01:12:10,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 474 transitions. [2022-11-22 01:12:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:12:10,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:10,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:12:10,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:12:10,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:10,635 INFO L85 PathProgramCache]: Analyzing trace with hash 674831532, now seen corresponding path program 1 times [2022-11-22 01:12:10,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:10,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689300851] [2022-11-22 01:12:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:10,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:10,766 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-22 01:12:10,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:10,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689300851] [2022-11-22 01:12:10,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689300851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:10,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:10,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:12:10,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809036913] [2022-11-22 01:12:10,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:10,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:12:10,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:10,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:12:10,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:12:10,769 INFO L87 Difference]: Start difference. First operand 256 states and 474 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:11,091 INFO L93 Difference]: Finished difference Result 242 states and 449 transitions. [2022-11-22 01:12:11,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:12:11,092 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 01:12:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:11,093 INFO L225 Difference]: With dead ends: 242 [2022-11-22 01:12:11,093 INFO L226 Difference]: Without dead ends: 242 [2022-11-22 01:12:11,094 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-22 01:12:11,094 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:11,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 6 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:12:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-22 01:12:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-11-22 01:12:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 175 states have (on average 2.565714285714286) internal successors, (449), 241 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 449 transitions. [2022-11-22 01:12:11,102 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 449 transitions. Word has length 5 [2022-11-22 01:12:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:11,103 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 449 transitions. [2022-11-22 01:12:11,104 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 449 transitions. [2022-11-22 01:12:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:12:11,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:11,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:12:11,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:12:11,105 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:11,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash 674831501, now seen corresponding path program 1 times [2022-11-22 01:12:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:11,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2935133] [2022-11-22 01:12:11,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:11,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:11,199 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-22 01:12:11,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:11,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2935133] [2022-11-22 01:12:11,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2935133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:11,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:11,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:12:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866259665] [2022-11-22 01:12:11,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:11,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:12:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:11,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:12:11,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:12:11,201 INFO L87 Difference]: Start difference. First operand 242 states and 449 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:11,498 INFO L93 Difference]: Finished difference Result 280 states and 506 transitions. [2022-11-22 01:12:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:12:11,498 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 01:12:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:11,500 INFO L225 Difference]: With dead ends: 280 [2022-11-22 01:12:11,500 INFO L226 Difference]: Without dead ends: 280 [2022-11-22 01:12:11,500 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-22 01:12:11,501 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:11,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:12:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-22 01:12:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 232. [2022-11-22 01:12:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 173 states have (on average 2.560693641618497) internal successors, (443), 231 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 443 transitions. [2022-11-22 01:12:11,515 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 443 transitions. Word has length 5 [2022-11-22 01:12:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:11,516 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 443 transitions. [2022-11-22 01:12:11,516 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 443 transitions. [2022-11-22 01:12:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:12:11,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:11,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:12:11,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:12:11,518 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:11,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:11,519 INFO L85 PathProgramCache]: Analyzing trace with hash -556312945, now seen corresponding path program 1 times [2022-11-22 01:12:11,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:11,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100771189] [2022-11-22 01:12:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:11,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:14,037 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-22 01:12:14,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:14,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100771189] [2022-11-22 01:12:14,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100771189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:14,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:14,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:12:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678697861] [2022-11-22 01:12:14,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:14,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:12:14,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:14,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:12:14,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:12:14,040 INFO L87 Difference]: Start difference. First operand 232 states and 443 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:14,483 INFO L93 Difference]: Finished difference Result 230 states and 439 transitions. [2022-11-22 01:12:14,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:12:14,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:12:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:14,485 INFO L225 Difference]: With dead ends: 230 [2022-11-22 01:12:14,485 INFO L226 Difference]: Without dead ends: 230 [2022-11-22 01:12:14,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:12:14,486 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:14,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 20 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:12:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-22 01:12:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-11-22 01:12:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 171 states have (on average 2.5672514619883042) internal successors, (439), 229 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:14,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 439 transitions. [2022-11-22 01:12:14,493 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 439 transitions. Word has length 6 [2022-11-22 01:12:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:14,493 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 439 transitions. [2022-11-22 01:12:14,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:14,494 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 439 transitions. [2022-11-22 01:12:14,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:12:14,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:14,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:12:14,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:12:14,495 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash -556156591, now seen corresponding path program 1 times [2022-11-22 01:12:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:14,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119385669] [2022-11-22 01:12:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:14,600 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-22 01:12:14,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:14,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119385669] [2022-11-22 01:12:14,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119385669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:14,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:14,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:12:14,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603800561] [2022-11-22 01:12:14,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:14,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:12:14,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:14,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:12:14,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:12:14,603 INFO L87 Difference]: Start difference. First operand 230 states and 439 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:14,846 INFO L93 Difference]: Finished difference Result 125 states and 212 transitions. [2022-11-22 01:12:14,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:12:14,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:12:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:14,848 INFO L225 Difference]: With dead ends: 125 [2022-11-22 01:12:14,848 INFO L226 Difference]: Without dead ends: 124 [2022-11-22 01:12:14,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 01:12:14,848 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:14,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:12:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-22 01:12:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-11-22 01:12:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 2.24468085106383) internal successors, (211), 123 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 211 transitions. [2022-11-22 01:12:14,853 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 211 transitions. Word has length 6 [2022-11-22 01:12:14,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:14,853 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 211 transitions. [2022-11-22 01:12:14,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:14,853 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2022-11-22 01:12:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:12:14,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:14,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:12:14,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:12:14,854 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-22 01:12:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash -555058393, now seen corresponding path program 1 times [2022-11-22 01:12:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:14,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803215344] [2022-11-22 01:12:14,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:14,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:12:14,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:12:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:12:14,973 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 01:12:14,974 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:12:14,975 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 52 remaining) [2022-11-22 01:12:14,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 52 remaining) [2022-11-22 01:12:14,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 52 remaining) [2022-11-22 01:12:14,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 52 remaining) [2022-11-22 01:12:14,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 52 remaining) [2022-11-22 01:12:14,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 52 remaining) [2022-11-22 01:12:14,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 52 remaining) [2022-11-22 01:12:14,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 52 remaining) [2022-11-22 01:12:14,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 52 remaining) [2022-11-22 01:12:14,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 52 remaining) [2022-11-22 01:12:14,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 52 remaining) [2022-11-22 01:12:14,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 52 remaining) [2022-11-22 01:12:14,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 52 remaining) [2022-11-22 01:12:14,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 52 remaining) [2022-11-22 01:12:14,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 52 remaining) [2022-11-22 01:12:14,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 52 remaining) [2022-11-22 01:12:14,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 52 remaining) [2022-11-22 01:12:14,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 52 remaining) [2022-11-22 01:12:14,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 52 remaining) [2022-11-22 01:12:14,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 52 remaining) [2022-11-22 01:12:14,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 52 remaining) [2022-11-22 01:12:14,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 52 remaining) [2022-11-22 01:12:14,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 52 remaining) [2022-11-22 01:12:14,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 52 remaining) [2022-11-22 01:12:14,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 52 remaining) [2022-11-22 01:12:14,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 52 remaining) [2022-11-22 01:12:14,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 52 remaining) [2022-11-22 01:12:14,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (24 of 52 remaining) [2022-11-22 01:12:14,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 52 remaining) [2022-11-22 01:12:14,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 52 remaining) [2022-11-22 01:12:14,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 52 remaining) [2022-11-22 01:12:14,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 52 remaining) [2022-11-22 01:12:14,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 52 remaining) [2022-11-22 01:12:14,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 52 remaining) [2022-11-22 01:12:14,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 52 remaining) [2022-11-22 01:12:14,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 52 remaining) [2022-11-22 01:12:14,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 52 remaining) [2022-11-22 01:12:14,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 52 remaining) [2022-11-22 01:12:14,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 52 remaining) [2022-11-22 01:12:14,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 52 remaining) [2022-11-22 01:12:14,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 52 remaining) [2022-11-22 01:12:14,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 52 remaining) [2022-11-22 01:12:14,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 52 remaining) [2022-11-22 01:12:14,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 52 remaining) [2022-11-22 01:12:14,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 52 remaining) [2022-11-22 01:12:14,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 52 remaining) [2022-11-22 01:12:14,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 52 remaining) [2022-11-22 01:12:14,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 52 remaining) [2022-11-22 01:12:14,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 52 remaining) [2022-11-22 01:12:14,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 52 remaining) [2022-11-22 01:12:14,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 52 remaining) [2022-11-22 01:12:14,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 52 remaining) [2022-11-22 01:12:14,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:12:14,990 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:12:14,996 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 01:12:14,996 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:12:15,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:12:15 BasicIcfg [2022-11-22 01:12:15,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:12:15,024 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:12:15,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:12:15,025 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:12:15,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:12" (3/4) ... [2022-11-22 01:12:15,027 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 01:12:15,067 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:12:15,067 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:12:15,068 INFO L158 Benchmark]: Toolchain (without parser) took 183924.28ms. Allocated memory was 144.7MB in the beginning and 333.4MB in the end (delta: 188.7MB). Free memory was 107.5MB in the beginning and 222.6MB in the end (delta: -115.0MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2022-11-22 01:12:15,068 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 111.1MB. Free memory was 57.8MB in the beginning and 57.6MB in the end (delta: 144.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:12:15,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 853.37ms. Allocated memory is still 144.7MB. Free memory was 107.2MB in the beginning and 111.5MB in the end (delta: -4.3MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2022-11-22 01:12:15,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.62ms. Allocated memory is still 144.7MB. Free memory was 111.5MB in the beginning and 108.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:12:15,069 INFO L158 Benchmark]: Boogie Preprocessor took 30.69ms. Allocated memory is still 144.7MB. Free memory was 108.1MB in the beginning and 106.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:12:15,070 INFO L158 Benchmark]: RCFGBuilder took 733.72ms. Allocated memory is still 144.7MB. Free memory was 106.6MB in the beginning and 82.1MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-22 01:12:15,070 INFO L158 Benchmark]: TraceAbstraction took 182202.56ms. Allocated memory was 144.7MB in the beginning and 333.4MB in the end (delta: 188.7MB). Free memory was 81.5MB in the beginning and 226.7MB in the end (delta: -145.3MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2022-11-22 01:12:15,070 INFO L158 Benchmark]: Witness Printer took 43.27ms. Allocated memory is still 333.4MB. Free memory was 226.7MB in the beginning and 222.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 01:12:15,072 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 111.1MB. Free memory was 57.8MB in the beginning and 57.6MB in the end (delta: 144.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 853.37ms. Allocated memory is still 144.7MB. Free memory was 107.2MB in the beginning and 111.5MB in the end (delta: -4.3MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.62ms. Allocated memory is still 144.7MB. Free memory was 111.5MB in the beginning and 108.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.69ms. Allocated memory is still 144.7MB. Free memory was 108.1MB in the beginning and 106.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 733.72ms. Allocated memory is still 144.7MB. Free memory was 106.6MB in the beginning and 82.1MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 182202.56ms. Allocated memory was 144.7MB in the beginning and 333.4MB in the end (delta: 188.7MB). Free memory was 81.5MB in the beginning and 226.7MB in the end (delta: -145.3MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. * Witness Printer took 43.27ms. Allocated memory is still 333.4MB. Free memory was 226.7MB in the beginning and 222.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 167.2s, 185 PlacesBefore, 62 PlacesAfterwards, 183 TransitionsBefore, 58 TransitionsAfterwards, 3136 CoEnabledTransitionPairs, 9 FixpointIterations, 162 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 249 TotalNumberOfCompositions, 12018 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5363, independent: 4853, independent conditional: 0, independent unconditional: 4853, dependent: 510, dependent conditional: 0, dependent unconditional: 510, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2276, independent: 2194, independent conditional: 0, independent unconditional: 2194, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2276, independent: 2131, independent conditional: 0, independent unconditional: 2131, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 145, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 403, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5363, independent: 2659, independent conditional: 0, independent unconditional: 2659, dependent: 428, dependent conditional: 0, dependent unconditional: 428, unknown: 2276, unknown conditional: 0, unknown unconditional: 2276] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 257, Positive conditional cache size: 0, Positive unconditional cache size: 257, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1244] 0 struct s *slot[10]; [L1254] 0 int j = __VERIFIER_nondet_int(); [L1255] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1255] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1256] 0 pthread_t t1; [L1257] 0 struct s *p; [L1258] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1258] RET, EXPR 0 new(1) [L1258] 0 slot[j] = new(1) [L1259] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1259] RET, EXPR 0 new(2) [L1259] EXPR 0 slot[j] [L1259] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node [L1241] 0 node->next = temp [L1259] RET 0 list_add(new(2), slot[j]) [L1260] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=8, mutex={1:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, slot={2:0}, t1={13:0}] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); VAL [\old(x)=3, \old(x)=2, \result={11:0}, malloc(sizeof(struct s))={-2:0}, mutex={1:0}, p={11:0}, p={-2:0}, slot={2:0}, x=2, x=3] [L1234] 1 p->datum = x VAL [\old(x)=2, \old(x)=3, \result={11:0}, mutex={1:0}, p={11:0}, p={-2:0}, slot={2:0}, x=2, x=3] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1260]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 239 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 182.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 167.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 660 IncrementalHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 50 mSDtfsCounter, 660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 84 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-22 01:12:15,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ae8125-ecd7-4fb7-ba30-8ca317e2a9eb/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)